A generalized Gleason-Pierce-Ward theorem

DOI10.1007/s10623-009-9286-yzbMath1174.94019OpenAlexW1970287371MaRDI QIDQ735040

Jon-Lark Kim, Xiaoyu Liu

Publication date: 14 October 2009

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

Full work available at URL: https://doi.org/10.1007/s10623-009-9286-y

zbMATH Keywords

additive codesWard's bounddivisble codesGleason-Pierce-Ward theoremtrace inner product

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Other types of codes (94B60)

Related Items (1)

An equivalence of Ward's bound and its application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lemma on polynomials modulo \(p^m\) and applications to coding theory
• A note on formally self-dual even codes of length divisible by 8
• Divisible codes
• On designs and formally self-dual codes
• Weight distributions of linear codes and the Gleason-Pierce theorem
• Classification of type IV self-dual \(\mathbb{Z}_4\)-codes of length 16
• On type IV self-dual codes over \(\mathbb Z_4\)
• Higher weights for ternary and quaternary self-dual codes*
• Optimal Self-Dual Codes Over>tex<$ BBF _2times BBF _2$>/tex<With Respect to the Hamming Weight
• A bound for divisible codes
• Duality for modules over finite rings and applications to coding theory
• Fundamentals of Error-Correcting Codes
• Type IV self-dual codes over rings
• Construction of optimal Type IV self-dual codes over F/sub 2/+uF/sub 2/
• Some results on type IV codes over Z4
• Quantum error correction via codes over GF(4)
• On the classification and enumeration of self-dual codes
• The divisible code bound revisited

This page was built for publication: A generalized Gleason-Pierce-Ward theorem