New developments in \(q\)-polynomial codes
From MaRDI portal
Publication:267804
DOI10.1007/S12095-015-0147-4zbMath1344.94093OpenAlexW2208585351MaRDI QIDQ267804
Chuan Lv, Guozhen Xiao, Tongjiang Yan
Publication date: 11 April 2016
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-015-0147-4
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A \(q\)-polynomial approach to cyclic codes
- On a class of error correcting binary group codes
- Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
- Primitive Normal Bases for Finite Fields
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- A Class of Error-Correcting Codes in $p^m $ Symbols
This page was built for publication: New developments in \(q\)-polynomial codes