New construction technique for q-ary Hamming codes for r = 2, q 3
From MaRDI portal
Publication:5740981
DOI10.12732/IJAM.V28I6.12zbMATH Open1401.94213OpenAlexW2253547777MaRDI QIDQ5740981FDOQ5740981
Authors: Tarun Lata, Vinod Tyagi 
Publication date: 20 July 2016
Published in: International Journal of Apllied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.12732/ijam.v28i6.12
Recommendations
- Construction of new completely regular \(q\)-ary codes from perfect \(q\)-ary codes
- On new completely regular \(q\)-ary codes
- Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components
- On the number of \(q\)-ary quasi-perfect codes with covering radius 2
- scientific article; zbMATH DE number 2239556
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
This page was built for publication: New construction technique for \(q\)-ary Hamming codes for \(r = 2\), \(q\geq 3\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740981)
