On sparse parity check matrices (extended abstract)

DOI10.1007/3-540-61332-3_137zbMATH Open1529.05158MaRDI QIDQ6142889FDOQ6142889

Authors: Hanno Lefmann, Pavel Pudlák, Petr Savický 

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Recommendations

• On sparse parity check matrices
• Sparse parity-check matrices over finite fields (extended abstract)
• Sparse Parity-Check Matrices over ${GF(q)}$
• scientific article; zbMATH DE number 1303555
• Sparse 0−1 Matrices and Forbidden Hypergraphs

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Linear codes (general theory) (94B05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Graph Theory and Probability
• Title not available (Why is that?)
• Simple Constructions of Almost k-wise Independent Random Variables
• Ramanujan graphs
• On Graphs that do not Contain a Thomsen Graph
• Cycles of even length in graphs
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Title not available (Why is that?)
• Minimal Regular Graphs of Girths Eight and Twelve
• A new series of dense graphs of high girth
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Union-free families of sets and equations over fields
• Title not available (Why is that?)

This page was built for publication: On sparse parity check matrices (extended abstract)

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