Optimal subcodes and optimum distance profiles of self-dual codes
From MaRDI portal
Publication:2434399
DOI10.1016/j.ffa.2013.09.002zbMath1305.94099arXiv1203.1527OpenAlexW1972672835MaRDI QIDQ2434399
Publication date: 5 February 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.1527
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete classification of doubly even self-dual codes of length 40
- On the enumeration of self-dual codes
- The binary self-dual codes of length up to 32: A revised enumeration
- On the \([28,7,12\) binary self-complementary codes and their residuals]
- Optimal binary linear codes of length \(\leq 30\)
- Optimal binary linear codes of dimension at most seven
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- Fundamentals of Error-Correcting Codes
- The extended quadratic residue code is the only (48,24,12) self-dual doubly-even code
- A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes
- On the Optimum Distance Profiles About Linear Block Codes
- On the classification and enumeration of self-dual codes
- Optimal subcodes of second order Reed-Muller codes and maximal linear spaces of bivectors of maximal rank
This page was built for publication: Optimal subcodes and optimum distance profiles of self-dual codes