Pages that link to "Item:Q1932464"
From MaRDI portal
The following pages link to The maximum number of minimal codewords in long codes (Q1932464):
Displaying 7 items.
- The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← 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)
- Counting Hamiltonian cycles in planar triangulations (Q2131865) (← links)
- Cycles in 5-connected triangulations (Q2284724) (← links)
- The minimum number of minimal codewords in an \([n, k]\)-code and in graphic codes (Q2341750) (← links)
- On the minimum number of minimal codewords (Q6112238) (← links)
