On the coveting radius of extremal self-dual codes
From MaRDI portal
Publication:4740486
DOI10.1109/TIT.1983.1056681zbMath0504.94028OpenAlexW2003050872MaRDI QIDQ4740486
Vera S. 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
Related Items (13)
Weight distributions of linear codes and the Gleason-Pierce theorem ⋮ A coding theoretic approach to extending designs ⋮ Extremal self-dual codes of length 64 through neighbors and covering radii ⋮ Self-dual codes which are principal ideals of the group algebra \(\mathbb{F}_ 2[\{\mathbb{F}_{2^ m},+\}\)] ⋮ Note on the residue codes of self-dual \(\mathbb{Z}_4\)-codes having large minimum Lee weights ⋮ On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2\) codes] ⋮ 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 ⋮ Singly even self-dual codes of length \(24k + 10\) and minimum weight \(4k + 2\) ⋮ Extremal self-dual \([40,20,8\) codes with covering radius 7] ⋮ Support weight enumerators and coset weight distributions of isodual codes ⋮ Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless ⋮ Covering radius and dual distance
This page was built for publication: On the coveting radius of extremal self-dual codes