Optimal Self-Dual Codes Over>tex<$ BBF _2times BBF _2$>/tex<With Respect to the Hamming Weight
From MaRDI portal
Publication:3546566
DOI10.1109/TIT.2003.822576zbMath1285.94118OpenAlexW1544046272MaRDI QIDQ3546566
Koichi Betsumiya, Masaaki Harada
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2003.822576
Related Items (9)
Cyclic and constacyclic codes over a non-chain ring ⋮ Bounds on covering radius of linear codes with Chinese Euclidean distance over the finite non chain ring \(\mathbb F_2+v\mathbb F_2\) ⋮ Structure of codes over the ring \(Z_3[v/\langle v^3 - v\rangle\)] ⋮ A new shortening method and Hermitian self-dual codes over \(\mathbb{F}_2 + v \mathbb{F}_2\) ⋮ Linear codes over \(\mathbb{F}_q\times (\mathbb{F}_q+v\mathbb{F}_q)\) ⋮ Weight distribution of double cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Quadratic residue codes over \(\mathbb{F}_p + v \mathbb{F}_p\) and their Gray images ⋮ On the classification and enumeration of self-dual codes ⋮ A generalized Gleason-Pierce-Ward theorem
This page was built for publication: Optimal Self-Dual Codes Over>tex<$ BBF _2times BBF _2$>/tex<With Respect to the Hamming Weight
