On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\)
From MaRDI portal
Publication:6177402
DOI10.1016/j.disc.2023.113796OpenAlexW4388901666MaRDI QIDQ6177402
Sachin Pathak, Anuradha Sharma
Publication date: 17 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113796
Cites Work
- Unnamed Item
- Unnamed Item
- Affine and projective planes
- A fast and simple algorithm for the money changing problem
- An algorithm for computing the automorphism group of a Hadamard matrix
- Permutation group algorithms based on partitions. I: Theory and algorithms
- On the structure of linear and cyclic codes over a finite chain ring
- Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.
- The average dimension of the hull of cyclic codes.
- Hulls of cyclic and negacyclic codes over finite fields
- Do non-free LCD codes over finite commutative Frobenius rings exist?
- Hulls of cyclic codes over \(\mathbb{Z}_4\)
- On self-dual cyclic codes over finite chain rings
- Dualities and identities for entanglement-assisted quantum codes
- Hulls of cyclic serial codes over a finite chain ring
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- On ternary self-dual codes of length 24
- Computing automorphism groups of error-correcting codes
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- On the Dimension of the Hull
- Is code equivalence easy to decide?
- Fundamentals of Error-Correcting Codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes
- Multivariable Codes Over Finite Chain Rings: Serial Codes
This page was built for publication: On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\)
