On the covering radius problem for ternary self-dual codes

DOI10.1016/S0304-3975(00)00252-8zbMath0973.68063MaRDI QIDQ5941523

Michio Ozeki

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

coset weight distributionsternary self-dual codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on optimal unimodular lattices
• On the ring of simultaneous invariants for the Gleason-MacWilliams group
• On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
• Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20
• On ternary self-dual codes of length 24
• On extremal self-dual ternary codes of lengths 28 to 40
• Self-Dual Codes over ${\text{GF}}( 3 )$
• Error-Correcting Codes and Invariant Theory: New Applications of a Nineteenth-Century Technique
• Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
• On the notion of Jacobi polynomials for codes
• Four fundamental parameters of a code and their combinatorial significance

This page was built for publication: On the covering radius problem for ternary self-dual codes