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

zbMATH Open1302.15021MaRDI QIDQ2935552FDOQ2935552

Authors: H. K. Nurijanyan 

Publication date: 30 December 2014

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

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)

Cited In (6)

• On minimal coset covering of solutions of a Boolean equation
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)