Pages that link to "Item:Q3858156"
From MaRDI portal
The following pages link to Decoding linear block codes for minimizing word error rate (Corresp.) (Q3858156):
Displaying 13 items.
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Fuzzy codes and distance properties (Q1169970) (← links)
- New approaches to reduced-complexity decoding (Q1180151) (← links)
- On the non-minimal codewords in binary Reed-Muller codes (Q1811092) (← links)
- Decomposition of modular codes for computing test sets and Graver basis (Q1949046) (← links)
- Construction of minimal linear codes from multi-variable functions (Q2025361) (← links)
- On the maximum number of minimal codewords (Q2037586) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- (Q2741451) (← links)
- Three Combinatorial Perspectives on Minimal Codes (Q5062110) (← links)
- Small Strong Blocking Sets by Concatenation (Q5883273) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)
- Strong blocking sets and minimal codes from expander graphs (Q6571606) (← links)
