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

DOI10.1016/J.DISC.2019.111780zbMATH Open1442.94060OpenAlexW2998520220MaRDI QIDQ2297733FDOQ2297733

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

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

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)

Cites Work

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

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)