Optimal b-symbol constacyclic codes with respect to the Singleton bound
From MaRDI portal
Publication:5132285
DOI10.1142/S0219498820501510zbMath1478.94138OpenAlexW2954576968WikidataQ114614604 ScholiaQ114614604MaRDI QIDQ5132285
Jirakom Sirisrisakulchai, Xiaoqiang Wang, Hai Quang Dinh
Publication date: 10 November 2020
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219498820501510
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Related Items (7)
A class of skew cyclic codes and application in quantum codes construction ⋮ Quantum codes from a class of constacyclic codes over finite commutative rings ⋮ Quantum codes from skew constacyclic codes over the ring \(\mathbb{F}_q [u, v \slash \langle u^2 - 1, v^2 - 1, u v - v u \rangle \)] ⋮ On matrix-product structure of repeated-root constacyclic codes over finite fields ⋮ On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths ⋮ 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}\) ⋮ Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
Cites Work
- Unnamed Item
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- Repeated-root constacyclic codes of length
- A class of constacyclic codes over a finite field
- Maximum distance separable codes for \(b\)-symbol read channels
- New constructions of MDS symbol-pair codes
- Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes
- Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4ps
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- A Construction of New MDS Symbol-Pair Codes
- Fundamentals of Error-Correcting Codes
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Codes for Symbol-Pair Read Channels
- Maximum Distance Separable Codes for Symbol-Pair Read Channels
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Repeated-root cyclic codes
This page was built for publication: Optimal b-symbol constacyclic codes with respect to the Singleton bound
