New developments in q-polynomial codes

DOI10.1007/S12095-015-0147-4zbMATH Open1344.94093OpenAlexW2208585351MaRDI QIDQ267804FDOQ267804

Authors: Chuan Lv, Tongjiang Yan, Guozhen Xiao 

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

Recommendations

• A \(q\)-polynomial approach to cyclic codes
• A \(q\)-polynomial approach to constacyclic codes
• Some \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)
• Polycyclic codes associated with trinomials: good codes and open questions
• Q-codes

zbMATH Keywords

trace functioncyclic codes\(q\)-polynomiallinearized polynomial

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Polyominoes (05B50)

Cites Work

• Title not available (Why is that?)
• On a class of error correcting binary group codes
• Title not available (Why is that?)
• Primitive Normal Bases for Finite Fields
• A \(q\)-polynomial approach to cyclic codes
• Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
• Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
• A Class of Error-Correcting Codes in $p^m $ Symbols

Cited In (3)

• A new class of cyclic codes using ordered power product of polynomials
• A \(q\)-polynomial approach to constacyclic codes
• A \(q\)-polynomial approach to cyclic codes

This page was built for publication: New developments in \(q\)-polynomial codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267804)