Pages that link to "Item:Q3547600"
From MaRDI portal
The following pages link to On the stopping distance and the stopping redundancy of codes (Q3547600):
Displaying 12 items.
- Generic erasure correcting sets: bounds and constructions (Q855874) (← links)
- Analysis of Termatiko sets in measurement matrices (Q2073193) (← links)
- Absorbing sets of codes from finite geometries (Q2325309) (← links)
- An iterative algorithm and low complexity hardware architecture for fast acquisition of long PN codes in UWB systems (Q2432159) (← links)
- On the stopping distance of LDPC codes based on symplectic space over finite fields (Q2661019) (← links)
- The stopping distance of binary BCH-code parity-check matrices (Q2918570) (← links)
- High stopping-distance LDPC product codes based on Hamming and finite geometry codes. (Q2918613) (← links)
- Stopping Sets of Hermitian Codes (Q2976509) (← links)
- On the Stopping Redundancy of Reed–Muller Codes (Q3548067) (← links)
- New Results on the Pseudoredundancy (Q4968623) (← links)
- Stopping Set Distributions of Some Reed–Muller Codes (Q5272384) (← links)
- Extremal absorbing sets in low-density parity-check codes (Q6112248) (← links)