Matrix-product structure of repeated-root cyclic codes over finite fields

DOI10.1016/J.FFA.2016.02.001zbMATH Open1339.94091OpenAlexW2278268719MaRDI QIDQ268495FDOQ268495

Authors: Reza Sobhani 

Publication date: 15 April 2016

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

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

Recommendations

• Repeated-root cyclic codes
• On repeated-root cyclic codes
• On matrix-product structure of repeated-root constacyclic codes over finite fields
• Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
• On generalizations of repeated-root cyclic codes

zbMATH Keywords

chain ringsmatrix-product codesrepeated-root cyclic codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15) Decoding (94B35)

Cites Work

• On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
• Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• Cyclic and Negacyclic Codes Over Finite Chain Rings
• Coset codes. II. Binary lattices and related codes
• Title not available (Why is that?)
• Weight distributions of cyclic self-dual codes
• On generalizations of repeated-root cyclic codes
• On repeated-root cyclic codes
• Repeated-root cyclic codes
• A propagation rule for linear codes
• On the structure of linear and cyclic codes over a finite chain ring
• Note on Niederreiter-Xing's propagation rule for linear codes
• Matrix product codes over finite commutative Frobenius rings
• A Generalization of Niederreiter–Xing's Propagation Rule and Its Commutativity With Duality
• Some ternary and quaternary codes and associated sphere packings
• Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
• General principles for the algebraic decoding of cyclic codes
• DECODING OF MATRIX-PRODUCT CODES
• Shift-register synthesis and BCH decoding
• Matrix-product codes over \(\mathbb{F}_q\)
• On the decoding of binary cyclic codes with the Newton identities
• Homogeneous weights of matrix product codes over finite principal ideal rings
• Construction and decoding of matrix-product codes from nested codes
• Matrix-product codes over finite chain rings

Cited In (12)

• On matrix-product structure of repeated-root constacyclic codes over finite fields
• Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
• Construction of new quantum codes via Hermitian dual-containing matrix-product codes
• Repeated-root cyclic codes
• Representation and matrix-product structure of type-1 constacyclic codes over \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• Matrix-product structure of constacyclic codes over finite chain rings \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• On the structure of repeated-root polycyclic codes over local rings
• Matrix-product codes over commutative rings and constructions arising from \((\sigma,\delta)\)-codes
• Non-standard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes. I
• New stabilizer codes from the construction of dual-containing matrix-product codes
• New quantum codes from matrix-product codes over small fields
• Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds

This page was built for publication: Matrix-product structure of repeated-root cyclic codes over finite fields

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