On products and powers of linear codes under componentwise multiplication
From MaRDI portal
Publication:2811784
DOI10.1090/conm/637/12749zbMath1397.94119arXiv1312.0022OpenAlexW1555268962MaRDI QIDQ2811784
Publication date: 10 June 2016
Published in: Algorithmic Arithmetic, Geometry, and Coding Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.0022
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Related Items (20)
The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes ⋮ On ideals in group algebras: an uncertainty principle and the Schur product ⋮ Properties of constacyclic codes under the Schur product ⋮ A class of constacyclic codes are generalized Reed-Solomon codes ⋮ MDS or NMDS LCD codes from twisted Reed-Solomon codes ⋮ Private information retrieval schemes using cyclic codes ⋮ Some new classes of additive MDS and almost MDS codes over finite fields ⋮ On the dimension and structure of the square of the dual of a Goppa code ⋮ Gaps between prime numbers and tensor rank of multiplication in finite fields ⋮ Harder-Narasimhan theory for linear codes (with an appendix on Riemann-Roch theory) ⋮ Trisymmetric multiplication formulae in finite fields ⋮ Construction of MDS twisted Reed-Solomon codes and LCD MDS codes ⋮ Towards a function field version of Freiman's theorem ⋮ Squares of matrix-product codes ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry ⋮ High dimensional affine codes whose square has a designed minimum distance ⋮ On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes ⋮ Yet another variation on minimal linear codes
This page was built for publication: On products and powers of linear codes under componentwise multiplication
