On covering radii and coset weight distributions of extremal binary self-dual codes of length 56

DOI10.1109/18.887850MaRDI QIDQ2705970zbMATH OpenOpenAlexFDO

Authors Michio Ozeki

Publication date 19 March 2001

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.887850

zbMATH Keywords

coset weight distributionsdoubly-even binary self-dual codesJacobi polynomials

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Review text

This paper presents a method for determining the complete coset weight distribution of an extremal doubly-even binary self-dual \([56,28,12]\) code. This method employs information from Jacobi polynomials. The key steps in the algorithm are: 1) Describe the shape of the basis for the linear space of rigid Jacobi polynomials associated with these codes for each index \(i\). 2) Describe the basis polynomials for the coset weight polynomials of the assigned coset weight \(i\) by means of rigid Jacobi polynomials of index \(i\). Multiplicity of the cosets of weight \(i\) have a connection with the frequency of the rigid reference binary vectors \(v\) of weight \(i\) for the Jacobi polynomials. Using this method, it is sufficient to obtain information on 8190 codewords of weight 12 (minimal weight) to determine the coset weight distribution of a binary doubly-even self-dual \([56,28,12]\) code. Several examples are given. This method can also be employed for singly-even self-dual codes and non-self-dual codes, but determining the complete coset weight distribution is much more complex in the latter case since the theory of invariants cannot be used.

Recommendations

• Jacobi polynomials for singly even self-dual codes and the covering radius problems
• On the covering radius problem for ternary self-dual codes
• On the Complete Coset Weight Distribution of the Extremal Self-Dual<tex>$[46, 23, 10]$</tex>Code
• scientific article; zbMATH DE number 493079
• Extremal self-dual \([40,20,8]\) codes with covering radius 7

Cited in

(5)

• On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
• On \(s\)-extremal singly even self-dual \([24k+8,12k+4,4k+2]\) codes
• scientific article; zbMATH DE number 5628622 (Why is no real title available?)
• Jacobi polynomials for singly even self-dual codes and the covering radius problems
• On the covering radius problem for ternary self-dual codes

This page was built for publication: On covering radii and coset weight distributions of extremal binary self-dual codes of length 56

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2705970)