Pages that link to "Item:Q5681912"
From MaRDI portal
The following pages link to Minimum-distance bounds for binary linear codes (Q5681912):
Displaying 12 items.
- An improvement of the Griesmer bound for some small minimum distances (Q1083427) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- Optimal ternary linear codes (Q1200308) (← links)
- Some binary maximin distance designs (Q1578228) (← links)
- On a signal processing algorithms based class of linear codes (Q1803557) (← links)
- Linear representations of cotriangular spaces (Q1837924) (← links)
- Linearly embeddable designs (Q2407711) (← links)
- On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius (Q3786402) (← links)
- On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes (Q3786403) (← links)
- Some Constructions for Convolutional and Block Codes (Q3960596) (← links)
- Tables of coverings for decoding by S-sets (Q4637811) (← links)
- On the classification and enumeration of self-dual codes (Q5905728) (← links)
