Higher weights for ternary and quaternary self-dual codes*

DOI10.1007/s10623-004-5663-8zbMath1172.94633MaRDI QIDQ2491260

Steven T. Dougherty, T. Aaron Gulliver, Manabu Oura

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-004-5663-8

zbMATH Keywords

graded rings; self-dual codes; higher weights; nonbinary codes; Gleason theorems

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

Related Items

A generalized Gleason-Pierce-Ward theorem, An example of an infinitely generated graded ring motivated by coding theory, On the cycle index and the weight enumerator, On some new m-spotty Lee weight enumerators

Cites Work

• Unnamed Item
• Support weight distribution of linear codes
• Self-dual codes over GF(4)
• Higher weights and graded rings for binary self-dual codes
• Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20
• Generalized Hamming weights for linear codes
• Self-Dual Codes over ${\text{GF}}( 3 )$
• Self-dual codes over<tex>GF(3)</tex>and<tex>GF(4)</tex>of length not exceeding 16
• Optimal double circulant self-dual codes over F/sub 4/
• Bounds on the minimum support weights
• Geometric approach to higher weights
• Generalizations of Gleason's theorem on weight enumerators of self-dual codes