On sparse parity check matrices (extended abstract)
From MaRDI portal
Publication:6142889
Recommendations
Cites work
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 3580531 (Why is no real title available?)
- scientific article; zbMATH DE number 1263215 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3031694 (Why is no real title available?)
- A new series of dense graphs of high girth
- Cycles of even length in graphs
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Graph Theory and Probability
- Minimal Regular Graphs of Girths Eight and Twelve
- On Graphs that do not Contain a Thomsen Graph
- Ramanujan graphs
- Simple Constructions of Almost k-wise Independent Random Variables
- Union-free families of sets and equations over fields
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)