High dimensional affine codes whose square has a designed minimum distance

DOI10.1007/S10623-020-00764-5zbMATH Open1453.94142arXiv1907.13068OpenAlexW3040075753MaRDI QIDQ782859FDOQ782859

Ignacio García Marco, Irene Márquez-Corbella, Diego Ruano

Publication date: 29 July 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Given a linear code $mathcalC$, its square code $mathcal{C}^{(2)}$ is the span of all component-wise products of two elements of $mathcalC$. Motivated by applications in multi-party computation, our purpose with this work is to answer the following question: which families of affine variety codes have simultaneously high dimension $k(mathcalC)$ and high minimum distance of $mathcal{C}^{(2)}$, $d(mathcal{C}^{(2)})$? More precisely, given a designed minimum distance $d$ we compute an affine variety code $mathcalC$ such that $d(mathcal{C}^{(2)})geqd$ and that the dimension of $mathcalC$ is high. The best construction that we propose comes from hyperbolic codes when $dgeq$ and from weighted Reed-Muller codes otherwise.

Full work available at URL: https://arxiv.org/abs/1907.13068

Recommendations

• scientific article; zbMATH DE number 2185736
• Squares of matrix-product codes
• Affine variety codes over a hyperelliptic curve
• Parameters of the codes over affine varieties
• Affine Cartesian codes

zbMATH Keywords

convex setMinkowski sumSchur product of codesmulti-party computationaffine variety codessquare codes

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

• On decoding by error location and dependent sets of error positions
• On products and powers of linear codes under componentwise multiplication
• Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
• On the second weight of generalized Reed-Muller codes
• Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
• General secure multi-party computation from any linear secret-sharing scheme
• Decoding affine variety codes using Gröbner bases
• Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
• Improved geometric Goppa codes. I. Basic theory
• Footprints or generalized Bezout's theorem
• Title not available (Why is that?)
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• Squares of matrix-product codes
• Squares of Random Linear Codes
• Weighted Reed-Muller codes and algebraic-geometric codes
• On Squares of Cyclic Codes
• Minimum distance functions of complete intersections
• Secure Multiparty Computation and Secret Sharing

Cited In (3)

• From primary to dual affine variety codes over the Klein quartic
• On the generalized Hamming weights of hyperbolic codes
• Title not available (Why is that?)

This page was built for publication: High dimensional affine codes whose square has a designed minimum distance

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