Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields
From MaRDI portal
Publication:2469468
DOI10.1016/j.ffa.2006.12.003zbMath1137.14016OpenAlexW2031271235MaRDI QIDQ2469468
Publication date: 6 February 2008
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2006.12.003
Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items
\(n\)-dimension quasi-twisted codes of arbitrary length over finite fields, Quasi-cyclic complementary dual codes, Commuting Pauli Hamiltonians as maps between free modules, On the number of rational points on Artin-Schreier hypersurfaces, 2-D skew-cyclic codes over \(\mathbb F_q[x,y;\rho ,\theta\)], A relation between quasi-cyclic codes and 2-D cyclic codes, A minimum distance bound for quasi-\(n\)D-cyclic codes, Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic function fields and codes
- On minimum distance bounds for abelian codes
- Elementary abelian \(p\)-extensions of algebraic function fields
- Finding recursions for multidimensional arrays
- Artin-Schreier curves and weights of two-dimensional cyclic codes
- Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
- The concatenated structure of cyclic and Abelian codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- A theory of two-dimensional cyclic codes
- The n-dimensional key equation and a decoding application
- Minimum distance bounds for cyclic codes and Deligne's theorem
- Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
- On generalized ReedMuller codes and their relatives
