Pages that link to "Item:Q1008963"
From MaRDI portal
The following pages link to On perfect \(p\)-ary codes of length \(p+1\) (Q1008963):
Displaying 4 items.
- Efficient representation of binary nonlinear codes: constructions and minimum distance computation (Q2350921) (← links)
- Parity check systems of nonlinear codes over finite commutative Frobenius rings (Q2408275) (← links)
- On non-full-rank perfect codes over finite fields (Q2414930) (← links)
- Classification of MDS Codes over Small Alphabets (Q3460469) (← links)
