On transitive partitions of an n-cube into codes-Reference-Cited by-同舟云学术

On transitive partitions of an n-cube into codes

Published:2009-03 Issue:1 Volume:45 Page:23-31
ISSN:0032-9460
Container-title:Problems of Information Transmission
language:en
Short-container-title:Probl Inf Transm

Author:

Solov’eva F. I.

Publisher

Pleiades Publishing Ltd

Subject

Computer Networks and Communications,Computer Science Applications,Information Systems

Link

http://link.springer.com/content/pdf/10.1134/S0032946009010037.pdf

Reference25 articles.

1. Solov’eva, F.I., On the Construction of Transitive Codes, Probl. Peredachi Inf., 2005, vol. 41, no. 3, pp. 23–31 [Probl. Inf. Trans. (Engl. Transl.), 2005, vol. 41, no. 3, pp. 204–211].

2. Solov’eva, F.I., On ℔4-linear Codes with the Parameters of Reed-Muller Codes, Probl. Peredachi Inf., 2007, vol. 43, no. 1, pp. 32–38 [Probl. Inf. Trans. (Engl. Transl.), 2007, vol. 43, no. 1, pp. 26–32].

3. Potapov, V.N., A Lower Bound for the Number of Transitive Perfect Codes, Diskretn. Anal. Issled. Oper., Ser. 1, 2006, vol. 13, no. 4, pp. 49–59 [J. Appl. Indust. Math. (Engl. Transl.), 2007, vol. 1, no. 3, pp. 373–379].

4. Malyugin, S.A., On Equivalence Classes of Perfect Binary Codes of Length 15, Preprint of Inst. Math., Siberian Branch of the RAS, Novosibirsk, 2004, no. 138.

5. Krotov, D.S., ℔4-linear Perfect Codes, Diskretn. Anal. Issled. Oper., Ser. 1, 2000, vol. 7, no. 4, pp. 78–90.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On transitive uniform partitions of $F^n$ into binary Hamming codes;Sibirskie Elektronnye Matematicheskie Izvestiya;2019-06-21

2. A Partition of the Hypercube into Maximally Nonparallel Hamming Codes;Journal of Combinatorial Designs;2013-07-08

3. On construction of vertex-transitive partitions of the n-cube into perfect codes;Journal of Applied and Industrial Mathematics;2011-04

4. Partitions of $\mathbb F$ⁿ into non-parallel Hamming codes;Advances in Mathematics of Communications;2009