Projective linear codes and their simplex complementary codes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3871188 (Why is no real title available?)
- scientific article; zbMATH DE number 3663006 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1250549 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A Bound for Error-Correcting Codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A note on the Griesmer bound (Corresp.)
- Algebraically punctured cyclic codes
- Anticode-based locally repairable codes with high availability
- Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Fundamentals of Error-Correcting Codes
- Hyperplane sections of Grassmannians and the number of MDS linear codes
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Linear Codes From Some 2-Designs
- Minimal Linear Codes From Characteristic Functions
- Minimal vectors in linear codes
- New 5-designs
- On a combinatorial conjecture of Erdös
- On block codes with specified maximum distance (Corresp.)
- On perfect codes and related concepts
- On strongly walk regular graphs, triple sum sets and their codes
- Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
- Shortened Linear Codes Over Finite Fields
- Subfield codes of several few-weight linear codes parameterized by functions and their consequences
- The Geometry of Two-Weight Codes
- The Subfield Codes of Some [q + 1, 2, q] MDS Codes
- The diametric theorem in Hamming spaces---optimal anticodes
This page was built for publication: Projective linear codes and their simplex complementary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6976608)