Parity check matrices and product representations of squares
From MaRDI portal
Publication:949791
DOI10.1007/s00493-008-2195-2zbMath1164.05005OpenAlexW2033490419MaRDI QIDQ949791
Assaf Naor, Jacques Verstraete
Publication date: 21 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-008-2195-2
finite fieldparity check matrixlinear dependencyeven hypergraph coverforbidden cycleproduct representations of squaresTuran type problem
Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Bounds on codes (94B65)
Related Items (3)
On Even-Degree Subgraphs of Linear Hypergraphs ⋮ An integer parallelotope with small surface area ⋮ Small Dense Subgraphs of a Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding and counting given length cycles
- The Moore bound for irregular graphs
- \(C_ 6\)-free bipartite graphs and product representation of squares
- On sparse parity check matrices
- The size of bipartite graphs with a given girth
- Cycles of even length in graphs
- On product representation of powers. I
- On Arithmetic Progressions of Cycle Lengths in Graphs
- Sparse Parity-Check Matrices over Finite Fields
- Expander codes
- Linear-time encodable and decodable error-correcting codes
- A logarithmic upper bound on the minimum distance of turbo codes
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Asymptotically Fast Factorization of Integers
- Simple Constructions of Almost k-wise Independent Random Variables
- Color-coding
- Cycles in bipartite graphs and an application in number theory
- Good error-correcting codes based on very sparse matrices
- Sparse 0−1 Matrices and Forbidden Hypergraphs
- A Note on Bipartite Graphs Without 2 k -Cycles
This page was built for publication: Parity check matrices and product representations of squares
