On sparse parity check matrices (extended abstract)

DOI10.1007/3-540-61332-3_137zbMath1529.05158MaRDI QIDQ6142889

Hanno Lefmann, Pavel Pudlák, Petr Savický

Publication date: 29 January 2024

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

Mathematics Subject Classification ID

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

Cites Work

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

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