Pages that link to "Item:Q2037586"
From MaRDI portal
The following pages link to On the maximum number of minimal codewords (Q2037586):
Displaying 10 items.
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
- Number of minimal-weight words in block codes (Q1122559) (← links)
- The maximum number of minimal codewords in long codes (Q1932464) (← links)
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph (Q2065789) (← links)
- On the non-minimality of the largest weight codewords in the binary Reed-Muller codes (Q2275886) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- A min-max theorem for antijamming group codes (Q3677650) (← links)
- (Q3807124) (← links)
- A minimax method with application to the initial vector coding problem<sup>*</sup> (Q4384040) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)