On the coveting radius of extremal self-dual codes
From MaRDI portal
Publication:4740486
DOI10.1109/TIT.1983.1056681zbMATH Open0504.94028OpenAlexW2003050872MaRDI QIDQ4740486FDOQ4740486
V. Pless, Edward F. jun. Assmus
Publication date: 1983
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1983.1056681
Cited In (13)
- Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
- In memoriam. A tribute to Vera Pless (1931--2020)
- On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
- A coding theoretic approach to extending designs
- Support weight enumerators and coset weight distributions of isodual codes
- Weight distributions of linear codes and the Gleason-Pierce theorem
- Note on the residue codes of self-dual \(\mathbb{Z}_4\)-codes having large minimum Lee weights
- Self-dual codes which are principal ideals of the group algebra \(\mathbb{F}_ 2[\{\mathbb{F}_{2^ m},+\}]\)
- Extremal self-dual \([40,20,8]\) codes with covering radius 7
- Singly even self-dual codes of length \(24k + 10\) and minimum weight \(4k + 2\)
- On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2]\) codes
- Covering radius and dual distance
- Extremal self-dual codes of length 64 through neighbors and covering radii
This page was built for publication: On the coveting radius of extremal self-dual codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740486)