Pages that link to "Item:Q3329382"
From MaRDI portal
The following pages link to On the minimum distance of some quadratic residue codes (Corresp.) (Q3329382):
Displaying 13 items.
- Some cyclic codes of length \(2p^n\) (Q634132) (← links)
- Minimum block length of a linear q-ary code with specified dimension and code distance (Q1061095) (← links)
- On the square-root bound for QR-codes (Q1106810) (← links)
- Random small Hamming weight products with applications to cryptography (Q1408370) (← links)
- Computing low-weight discrete logarithms (Q1746959) (← links)
- Minimal quadratic residue cyclic codes of length \(2^n\) (Q2386795) (← links)
- Some baby-step giant-step algorithms for the low Hamming weight discrete logarithm problem (Q2759107) (← links)
- Minimal quadratic residue cyclic codes of length \(p^n\) (\(p\) odd prime) (Q2761611) (← links)
- On a Sufficient Condition to Attain Minimum Square Distance in Euclidean Codes (Q3088412) (← links)
- Quasi-Perfect Codes With Small Distance (Q3546852) (← links)
- A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents (Q5445461) (← links)
- Weight and distance structure of Nordstrom-Robinson quadratic code (Q5556896) (← links)
- On the classification and enumeration of self-dual codes (Q5921637) (← links)
