On products and powers of linear codes under componentwise multiplication

DOI10.1090/CONM/637/12749MaRDI QIDQ2811784zbMATH OpenOpenAlexFDO

Authors Hugues Randriam

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Abstract: In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that could otherwise probably not fit in a regular research paper. On the other hand, more advanced results and applications are only quickly mentioned with references to the literature. We also point out a few open problems. Our presentation alternates between two points of view, which the theory intertwines in an essential way: that of combinatorial coding, and that of algebraic geometry. In appendices that can be read independently, we investigate topics in multilinear algebra over finite fields, notably we establish a criterion for a symmetric multilinear map to admit a symmetric algorithm, or equivalently, for a symmetric tensor to decompose as a sum of elementary symmetric tensors.

Recommendations

• scientific article; zbMATH DE number 1795249
• On the weight hierarchy of product codes
• A lower bound on the weight hierarchies of product codes.
• Algebraic geometric codes with applications
• Some remarks on multiplicity codes

Cited in

(26)

• Gaps between prime numbers and tensor rank of multiplication in finite fields
• Yet another variation on minimal linear codes
• Harder-Narasimhan theory for linear codes (with an appendix on Riemann-Roch theory)
• Squares of matrix-product codes
• Decoding multivariate multiplicity codes on product sets
• scientific article; zbMATH DE number 5903167 (Why is no real title available?)
• A class of constacyclic codes are generalized Reed-Solomon codes
• scientific article; zbMATH DE number 7339515 (Why is no real title available?)
• On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
• The McEliece-type cryptosystem based on \(D\)-codes
• Private information retrieval schemes using cyclic codes
• Towards a function field version of Freiman's theorem
• Structural properties of self-dual monomial codes with application to code-based cryptography
• Trisymmetric multiplication formulae in finite fields
• Some new classes of additive MDS and almost MDS codes over finite fields
• On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
• The coding power of a product of partitions
• On ideals in group algebras: an uncertainty principle and the Schur product
• MDS or NMDS LCD codes from twisted Reed-Solomon codes
• The quadratic hull of a code and the geometric view on multiplication algorithms
• Properties of constacyclic codes under the Schur product
• High dimensional affine codes whose square has a designed minimum distance
• Cryptanalysis of the BBCRS system on Reed-Muller binary code
• On the dimension and structure of the square of the dual of a Goppa code
• Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
• A Hadamard product of linear codes: algebraic properties and algorithms for calculating it

This page was built for publication: On products and powers of linear codes under componentwise multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811784)