On the coveting radius of extremal self-dual codes

DOI10.1109/TIT.1983.1056681MaRDI QIDQ4740486zbMATHOpenAlexFDO

Authors Edward F. jun. Assmus, V. Pless

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

zbMATH Keywords

quadratic residue codecomplete coset weight distribution

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(13)

• A coding theoretic approach to extending designs
• In memoriam. A tribute to Vera Pless (1931--2020)
• Extremal self-dual codes of length 64 through neighbors and covering radii
• Support weight enumerators and coset weight distributions of isodual codes
• Covering radius and dual distance
• Weight distributions of linear codes and the Gleason-Pierce theorem
• Guest editorial: on coding theory and combinatorics -- in memory of Vera Pless
• Self-dual codes which are principal ideals of the group algebra \(\mathbb{F}_ 2[\{\mathbb{F}_{2^ m},+\}]\)
• On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
• Extremal self-dual \([40,20,8]\) codes with covering radius 7
• On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2]\) codes
• Note on the residue codes of self-dual \(\mathbb{Z}_4\)-codes having large minimum Lee weights
• Singly even self-dual codes of length \(24k + 10\) and minimum weight \(4k + 2\)

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)