Pages that link to "Item:Q3546537"
From MaRDI portal
The following pages link to Distance properties of expander codes (Q3546537):
Displaying 13 items.
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966) (← links)
- On Tanner codes: Minimum distance and decoding (Q1566399) (← links)
- Linear-time list recovery of high-rate expander codes (Q1640994) (← links)
- AC-RRNS: anti-collusion secured data sharing scheme for cloud storage (Q1726264) (← links)
- Some combinatorial aspects of constructing bipartite-graph codes (Q1950398) (← links)
- On planes through points off the twisted cubic in \(\mathrm{PG}(3,q)\) and multiple covering codes (Q1994925) (← links)
- Twisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\) (Q2147366) (← links)
- Twisted cubic and point-line incidence matrix in \(\operatorname{PG}(3,q)\) (Q2232117) (← links)
- Local correctability of expander codes (Q2347805) (← links)
- On the sizes of expander graphs and minimum distances of graph codes (Q2449138) (← links)
- A new formula for the minimum distance of an expander code (Q5884135) (← links)
- Incidence matrices for the class \({\mathcal{O}}_6\) of lines external to the twisted cubic in \(\mathrm{PG}(3,q)\) (Q6115813) (← links)
- Phase transitions of structured codes of graphs (Q6561324) (← links)
