An upper bound for the complexity of linearized coverings in a finite field

MaRDI QIDQ2935552zbMATH OpenFDO

Authors H. K. Nurijanyan

Publication date 30 December 2014

zbMATH Keywords

finite fieldslinearized coveringssystem of linear equations over finite fields

Mathematics Subject Classification ID

Finite fields (field-theoretic aspects) (12E20) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• scientific article; zbMATH DE number 6862207
• scientific article; zbMATH DE number 808806
• Covering numbers in linear algebra
• On coset coverings of solutions of homogeneous cubic equations over finite fields
• On minimal coset covering of solutions of a Boolean equation

Cited in

(6)

• On minimal coset covering of solutions of a Boolean equation
• scientific article; zbMATH DE number 7039353 (Why is no real title available?)
• scientific article; zbMATH DE number 7145270 (Why is no real title available?)
• The complexity of linear problems in fields
• On coset coverings of solutions of homogeneous cubic equations over finite fields
• Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.

This page was built for publication: An upper bound for the complexity of linearized coverings in a finite field

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