Add to ORKGFollowing standard notation, an (n,m, d) code C denotes a binary code C which has length n, size m, and Hamming distance d. According to Hill [6] the “main coding theory problem ” is to optimize one of these three parameters when the other two are held fixed. The usual version of thi
In this Letter the combinatorial optimisation algorithm known as simulated annealing is used for the...
Best and Brouwer proved that triply-shortened and doubly-shortened binary Hamming codes (which have ...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
Following standard notation, an (n, m, d) code C denotes a binary code C which has length n, size m,...
Abstract. This paper shows how to determine if codes are of optimal size. We discuss coding theory t...
We address the problem of designing codes for specific applications using deterministic annealing. D...
In this thesis we address the problem of designing codes for specific applications. To do so we make...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
We propose a method based on cluster expansion to study the optimal code with a given distance betwe...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
A systematic nonlinear code having length 15, minimum distance 5, and 256 code words is given in Boo...
Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a vari...
AbstractAhlswede and Katona posed the following average distance problem: For every n and 1⩽M⩽2n, de...
In this Letter the combinatorial optimisation algorithm known as simulated annealing is used for the...
Best and Brouwer proved that triply-shortened and doubly-shortened binary Hamming codes (which have ...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...
Following standard notation, an (n, m, d) code C denotes a binary code C which has length n, size m,...
Abstract. This paper shows how to determine if codes are of optimal size. We discuss coding theory t...
We address the problem of designing codes for specific applications using deterministic annealing. D...
In this thesis we address the problem of designing codes for specific applications. To do so we make...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
We propose a method based on cluster expansion to study the optimal code with a given distance betwe...
Let n(k, d) be the smallest integer n for which a binary linear code of length n, dimension k, and m...
A systematic nonlinear code having length 15, minimum distance 5, and 256 code words is given in Boo...
Constructions of [162,8,80] and [159,8,78] codes are given. This solves the open problems of finding...
The maximum number of codewords in a binary code with length n and minimum distance d is denoted by ...
This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a vari...
AbstractAhlswede and Katona posed the following average distance problem: For every n and 1⩽M⩽2n, de...
In this Letter the combinatorial optimisation algorithm known as simulated annealing is used for the...
Best and Brouwer proved that triply-shortened and doubly-shortened binary Hamming codes (which have ...
Let A(n, d) denote the maximum number of codewords in a binary code of length n and minimum Hamming ...