On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
From MaRDI portal
Publication:3337372
Recommendations
- Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry
- Quasi-Perfect Linear Codes With Minimum Distance $4$
- scientific article; zbMATH DE number 1439466
- On codewords in the dual code of classical generalised quadrangles and classical polar spaces
- Small weight codewords in the dual code of points and hyperplanes in PG\((n, q), q\) even
Cited in
(19)- Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\)
- On a pair of dual subschemes of the Hamming scheme \(H_ n(q)\)
- Multiple coverings of the farthest-off points with small density from projective geometry
- SPG-reguli, SPG-systems, BLT-sets and sets with the BLT-property
- scientific article; zbMATH DE number 4168394 (Why is no real title available?)
- The diophantine equation \(x^ 2=4q^{a/2}+4q+1\), with an application to coding theory
- scientific article; zbMATH DE number 5670445 (Why is no real title available?)
- On a conjecture of Ma
- On two-weight \(\mathbb {Z}_{2^k}\)-codes
- The Griesmer codes of Belov type and optimal quaternary codes via multi-variable functions
- Intriguing sets in partial quadrangles
- Some necessary conditions on the parameters of partial difference sets
- On near-polygons and the Coxeter cap in PG(5,3)
- On the diophantine equation \(x^ 2-D=4p^ n\)
- A general family of Plotkin-optimal two-weight codes over \(\mathbb{Z}_4\)
- Designs as maximum codes in polynomial metric spaces
- A survey of partial difference sets
- On the Diophantine equation \(y^2=4q^n+4q+1\)
- On the 430-cap of \(\mathrm{PG}(6,4)\) having two intersection sizes with respect to hyperplanes
This page was built for publication: On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337372)
