Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
From MaRDI portal
Publication:6568921
DOI10.1007/S00200-023-00605-7MaRDI QIDQ6568921
Publication date: 8 July 2024
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Cites Work
- On constacyclic codes over finite fields
- Repeated-root constacyclic codes of length \(\ell p^s\) and their duals
- The Hamming distances of repeated-root cyclic codes of length \(5 p^s\)
- Codes for the \(m\)-metric
- A mass formula for cyclic codes over Galois rings of characteristic \(p^3\)
- The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)
- A coding theory construction of new systematic authentication codes
- Classification of self-dual cyclic codes over the chain ring \(\mathbb Z_p[u/\langle u^3 \rangle \)]
- Construction of minimal linear codes from multi-variable functions
- On cyclic codes over Galois rings
- On rank and MDR cyclic and negacyclic codes of length \(p^k\) over \(\mathbb Z_{p^m}\)
- Infinite families of MDR cyclic codes over \(\mathbb{Z}_4\) via constacyclic codes over \(\mathbb{Z}_4 [u \slash \langle u^2 - 1 \rangle \)]
- Classification of cyclic codes over a non-Galois chain ring \(\mathbb{Z}_p [u / \langle u^3 \rangle\)]
- Complete classification of \((\delta + \alpha u^2)\)-constacyclic codes of length \(p^k\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m} + u^2 \mathbb{F}_{p^m}\)
- Lee weights of cyclic self-dual codes over Galois rings of characteristic \(p^2\)
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- On the Structure and Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over Finite Commutative Chain Rings
- Codes for Symbol-Pair Read Channels
- Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
This page was built for publication: Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568921)