Optimal subcodes of formally self-dual codes and their optimum distance profiles
From MaRDI portal
Publication:371244
DOI10.1007/S00200-013-0195-YzbMATH Open1283.94111OpenAlexW2145511596MaRDI QIDQ371244FDOQ371244
Authors: Finley Freibert, Jon-Lark Kim 
Publication date: 30 September 2013
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-013-0195-y
Recommendations
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Fundamentals of Error-Correcting Codes
- Binary optimal odd formally self-dual codes.
- Optimal binary linear codes of length \(\leq 30\)
- On the classification of extremal even formally self-dual codes of lengths 20 and 22
- The \([18,9,6]\) code is unique
- Binary optimal linear rate 1/2 codes
- Optimal subcodes and optimum distance profiles of self-dual codes
- A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes
- On the Optimum Distance Profiles About Linear Block Codes
- Optimal subcodes of second order Reed-Muller codes and maximal linear spaces of bivectors of maximal rank
- Classification of formally self-dual even codes of lengths up to 16
Cited In (2)
Uses Software
This page was built for publication: Optimal subcodes of formally self-dual codes and their optimum distance profiles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q371244)
