Related papers: New results on binary linear codes
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary…
In this paper we show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance of a code. We have…
In the paper "New Results on Frame-Proof Codes and Traceability Schemes" by Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 3029-3033, Nov. 2001], there are lower bounds for the maximal number of…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
We give a complete classification of binary linear complementary dual codes of lengths up to $13$ and ternary linear complementary dual codes of lengths up to $10$.
It is shown that there does not exist a binary projective triply-even code of length $59$. This settles the last open length for projective triply-even binary codes. Therefore, projective triply-even binary codes exist precisely for lengths…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…
A self-dual binary linear code is called Type I code if it has singly-even codewords, i.e.~it has codewords with weight divisible by $2.$ The purpose of this paper is to investigate interesting properties of Type I codes of different…
Sixteen new linear codes are presented: three of them improve the lower bounds on the minimum distance for a linear code and the rest are an explicit construction of unknown codes attaining the lower bounds on the minimum distance. They are…
We leverage proof techniques Fourier analysis and an existing result in coding theory to derive new bounds for the problem of non-interactive simulation of binary random variables. Previous bounds in the literature were derived by applying…
We prove the non existence of quantum caps of sizes 37 and 39. This completes the spectrum of quantum caps in PG(4, 4). This also implies the non existence of linear [[37,27,4]] and [[39,29,4]]-codes. The problem of the existence of non…
Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…
Let $A(n,d,w)$ be the largest possible size of an $(n,d,w)$ constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper bounds on $A(n,d,w)$ for $n \leq 28$. The used techniques…
Non-binary codes correcting multiple deletions have recently attracted a lot of attention. In this work, we focus on multiplicity-free codes, a family of non-binary codes where all symbols are distinct. Our main contribution is a new…
We solve one of the oldest problems in the theory of quantum stabilizer codes by proving the non-existence of quantum [[13,5,4]]-codes.
This paper examines linear binary codes capable of correcting one or more errors. For the single-error-correcting case, it is shown that the Hamming bound is achieved by a constructive method, and an exact expression for the minimal…
This is the TeX version of the {\it Mathematica} file used to prove there is no Type II binary code with parameters [72, 36, 16] or [96, 48, 20].
In this paper, we employ group rings and automorphism groups of binary linear codes to construct new record-breaking binary linear codes. We consider the semidirect product of abelian groups and cyclic groups and use these groups to…
In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern $(10)^j1$ for any fixed $j \geq 1$. We will prove that this generation is exhaustive, that is,…