On the construction of transitive codes
From MaRDI portal
Publication:2432946
DOI10.1007/S11122-005-0025-3zbMATH Open1102.94029OpenAlexW2064117721MaRDI QIDQ2432946FDOQ2432946
Authors: Faina I. Solov'eva 
Publication date: 26 October 2006
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11122-005-0025-3
Recommendations
Cites Work
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A characterization of 1-perfect additive codes
- Title not available (Why is that?)
- On binary 1-perfect additive codes: some structural properties
- A Generalized Parity Function and Its Use in the Construction of Perfect Codes
- Title not available (Why is that?)
- Z4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
- Title not available (Why is that?)
- The rank and kernel of extended 1-perfect Z/sub 4/-linear and additive non- Z/sub 4/-linear codes
- Design and verification of logical models
Cited In (13)
- On separability of the classes of homogeneous and transitive perfect binary codes
- Transitive nonpropelinear perfect codes
- Entry-faithful 2-neighbour transitive codes
- Theoretical Aspects of Computing – ICTAC 2005
- On construction of vertex-transitive partitions of the \(n\)-cube into perfect codes
- On the symmetry group of the Mollard code
- On transitive partitions of an \(n\)-cube into codes
- On extremely transitive extended perfect codes
- On the Kronecker Product Construction of Completely Transitive q-Ary Codes
- On perfect binary codes
- Translation-invariant propelinear codes
- On the Construction of (Explicit) Khodak's Code and Its Analysis
- On the number of nonequivalent propelinear extended perfect codes
This page was built for publication: On the construction of transitive codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432946)
