Additive codes with few weights
From MaRDI portal
Publication:6643247
DOI10.1007/S12095-024-00720-3MaRDI QIDQ6643247
Qiang Wang, Murat Sahin, Daniel Panario
Publication date: 26 November 2024
Published in: Cryptography and Communications (Search for Journal in Brave)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A construction of binary linear codes from Boolean functions
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- The nonexistence of an additive quaternary \([15, 5, 9]\)-code
- Minimum-check-density codes for correcting bytes of errors, erasures, or defects
- Polynomial description of binary linear codes and related properties
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Self-dual codes over the Kleinian four group
- Some two-weight and three-weight linear codes
- Linear codes from weakly regular plateaued functions and their secret sharing schemes
- Recent results and problems on constructions of linear codes from cryptographic functions
- Linear codes with few weights from cyclotomic classes and weakly regular bent functions
- A construction of several classes of two-weight and three-weight linear codes
- Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\)
- Binary linear codes from vectorial Boolean functions and their weight distribution
- Two-weight and three-weight linear codes based on Weil sums
- Directed graph representation of half-rate additive codes over \(\text{GF}(4)\)
- Three classes of linear codes with two or three weights
- On additive GF(4) codes
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear Codes From Some 2-Designs
- A Construction of Linear Codes Over ${\mathbb {F}}_{2^t}$ From Boolean Functions
- Decoding the Golay code with Venn diagrams
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Lowest density MDS codes over extension alphabets
- The weight distribution of a class of linear codes from perfect nonlinear functions
- Cyclotomic Linear Codes of Order $3$
- New array codes for multiple phased burst correction
- EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
- Quantum error correction via codes over GF(4)
- Minimal vectors in linear codes
- X-code: MDS array codes with optimal encoding
- On lowest density MDS codes
- MDS array codes with independent parity symbols
- On extremal additive \({\mathbb{F}}_4\) codes of length 10 to 18
This page was built for publication: Additive codes with few weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6643247)