Two dimensional constacyclic codes of arbitrary length over finite fields
From MaRDI portal
Publication:2124821
DOI10.1007/s13226-021-00087-8OpenAlexW3081991430MaRDI QIDQ2124821
Publication date: 11 April 2022
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.14921
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15)
Cites Work
- A class of constacyclic codes over a finite field. II
- \((1-2u^{3})\)-constacyclic codes and quadratic residue codes over \(\mathbb {F}_{p}[u/\langle u^{4}-u\rangle \)]
- Characterizations of some two-dimensional cyclic codes correspond to the ideals of \(\mathbb{F} [x, y / < x^s - 1, y^{2^k} - 1 >\)]
- A relation between quasi-cyclic codes and 2-D cyclic codes
- A class of constacyclic codes over a finite field
- Repeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\)
- Duadic and triadic codes over a finite non-chain ring and their Gray images
- Polyadic constacyclic codes over a non-chain ring \(\mathbb{F}_q[u,v/\langle f(u), g(v), uv-vu\rangle\)]
- 2-D skew-cyclic codes over \(\mathbb F_q[x,y;\rho ,\theta\)]
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
- A theory of two-dimensional cyclic codes
