A \(q\)-polynomial approach to cyclic codes

DOI10.1016/J.FFA.2012.12.005zbMath1308.94107OpenAlexW2155646763MaRDI QIDQ1943457

Cunsheng Ding, San Ling

Publication date: 20 March 2013

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2012.12.005

zbMATH Keywords

linear codes\(q\)-polynomialscyclic codeslinearized polynomials

Mathematics Subject Classification ID

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

Related Items (14)

New developments in \(q\)-polynomial codes ⋮ Linear permutations and their compositional inverses over 𝔽qn ⋮ Several classes of optimal ternary cyclic codes with minimal distance four ⋮ Cyclic codes from two-prime generalized cyclotomic sequences of order 6 ⋮ A \(q\)-polynomial approach to constacyclic codes ⋮ Two families of optimal ternary cyclic codes with minimal distance four ⋮ Optimal ternary cyclic codes with minimum distance four and five ⋮ A new class of distance-optimal binary cyclic codes and their duals ⋮ Optimal \(p\)-ary cyclic codes with two zeros ⋮ Two classes of new optimal ternary cyclic codes ⋮ A class of optimal ternary cyclic codes and their duals ⋮ Complete weight distributions of two classes of cyclic codes ⋮ On an open problem about a class of optimal ternary cyclic codes ⋮ On coefficient constraints and evaluation restrictions for linearized polynomials

This page was built for publication: A \(q\)-polynomial approach to cyclic codes