On the b-distance of repeated-root constacyclic codes of prime power lengths

DOI10.1016/J.DISC.2019.111780MaRDI QIDQ2297733zbMATH OpenOpenAlexFDO

Authors Xiaoqiang Wang, Songsak Sriboonchitta, Hai Quang Dinh, Hongwei Liu

Publication date 20 February 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2019.111780

zbMATH Keywords

Hamming distancegenerator polynomialconstacyclic coderepeated-root codesimple-root code

Mathematics Subject Classification ID

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

Recommendations

• On Hamming and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\)
• Optimal \(b\)-symbol constacyclic codes with respect to the Singleton bound
• On the Hamming distances of repeated-root constacyclic codes of length 4p^s
• On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
• Symbol-triple distance of repeated-root constacyclic codes of prime power lengths

Cites work

• scientific article; zbMATH DE number 1243360 (Why is no real title available?)
• A Construction of New MDS Symbol-Pair Codes
• A class of constacyclic codes over a finite field
• Codes for Symbol-Pair Read Channels
• Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
• Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
• Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
• Fundamentals of Error-Correcting Codes
• Maximum distance separable codes for b-symbol read channels
• New constructions of MDS symbol-pair codes
• On repeated-root constacyclic codes of length \(4p^s\)
• On repeated-root cyclic codes
• On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
• On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
• Optimal \(b\)-symbol constacyclic codes with respect to the Singleton bound
• Polynomial weights and code constructions
• Repeated-root constacyclic codes of length
• Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
• Repeated-root cyclic codes
• Structure of repeated-root constacyclic codes of length 3p^s and their duals
• The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)

Cited in

(6)

• Cyclic codes of length \(5p\) with MDS symbol-pair
• Another expression of the MacWilliams identities and its applications
• \(b\)-symbol distance distribution of repeated-root cyclic codes
• Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
• Construction of optimal codes from a class of constacyclic codes
• Optimal \(b\)-symbol constacyclic codes with respect to the Singleton bound

This page was built for publication: On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths

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