Pages that link to "Item:Q3547746"
From MaRDI portal
The following pages link to Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding (Q3547746):
Displaying 13 items.
- Plateaued functions and one-and-half difference sets (Q494589) (← links)
- High-rate LDPC codes from partially balanced incomplete block designs (Q2114791) (← links)
- Construction of LDPC convolutional codes via difference triangle sets (Q2232118) (← links)
- On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes (Q2363320) (← links)
- Nonexistence of sparse triple systems over abelian groups and involutions (Q2458260) (← links)
- Construction of minimum bandwidth regenerating codes with combinatorial design (Q2825280) (← links)
- New class of quantum codes constructed from cyclic difference set (Q2884834) (← links)
- (Q3054157) (← links)
- MaxMinSum Steiner Systems for Access Balancing in Distributed Storage (Q3174717) (← links)
- Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques (Q3548235) (← links)
- On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size (Q3548292) (← links)
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs (Q5171197) (← links)
- Super-simple \((v, 5, 2)\) directed designs and their smallest defining sets with application in LDPC codes (Q6185744) (← links)
