Characteristic vector and weight distribution of a linear code
From MaRDI portal
Publication:2040349
DOI10.1007/s12095-020-00458-8zbMath1469.94126arXiv1809.07090OpenAlexW2963234349MaRDI QIDQ2040349
Stefka Bouyuklieva, Paskal Piperkov, Tatsuya Maruta, Iliya G. Bouyukliev
Publication date: 13 July 2021
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07090
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ideal associated to a linear code
- Gröbner bases and combinatorics for binary codes
- A method for efficiently computing the number of codewords of fixed weights in linear codes
- A commutative algebra approach to linear codes
- Codes and projective multisets
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- \(q\)-ary Gray codes and weight distributions
- The Magma algebra system. I: The user language
- A deterministic algorithm for the distance and weight distribution of binary nonlinear codes
- Codes, Arrangements and Matroids
- Algebraic Function Fields and Codes
- GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
- On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions
- On the inherent intractability of certain coding problems (Corresp.)
- On the weight distribution of binary linear codes (Corresp.)
- The intractability of computing the minimum distance of a code
- Sufficient conditions for good and proper error-detecting codes
- Fundamentals of Error-Correcting Codes
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Algorithmic Cryptanalysis
- Computing coset leaders and leader codewords of binary codes
- Generalizations of Gleason's theorem on weight enumerators of self-dual codes
This page was built for publication: Characteristic vector and weight distribution of a linear code
