Weight enumerators of self-orthogonal codes
From MaRDI portal
Publication:1211033
DOI10.1016/0012-365X(74)90085-5zbMath0289.94007MaRDI QIDQ1211033
N. J. A. Sloane, Colin L. Mallows
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial aspects of finite geometries (05B25) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items
Codes with given distances, Selbstduale Codes über dem Ring der ganzen Zahlen modulo 4. (Self-dual codes over the ring of integers modulo 4), The application of invariant theory to the existence of quasi-symmetric designs, Algebraic theory of block codes detecting independent errors, The biweight enumerator of self-orthogonal binary codes, New binary quantum stabilizer codes from the binary extremal self-dual \([48,24,12\) code], Non-symmetric 2-designs modulo 2, The nonexistence of ovals in a projective plane of order 10, Bounds for self-dual codes over \(\mathbb{Z}_4\), The nonexistence of code words of weight 16 in a projective plane of order 10
Uses Software
Cites Work
- On the Golay perfect binary code
- A characterisation of Leech's lattice
- Codes with simple automorphism groups
- Good self dual codes exist
- Nearly perfect binary codes
- On the existence of a projective plane of order 10
- A classification of self-orthogonal codes over GF(2)
- Self-dual codes over gf(q) satisfy a modified varshamov-gilbert bound
- An optimum nonlinear code
- New binary coding results by circulants
- New 5-designs
- A Group of Order 8,315,553,613,086,720,000
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian Group
- New family of single-error correcting codes
- Sphere Packings and Error-Correcting Codes
- Gleason's theorem on self-dual codes
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
- An upper bound for self-dual codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
