Add to ORKGCombinatorics, Coding and Security Group (CCSG)A binary nonlinear code can be represented as a union of cosets of a binary linear subcode. In this paper, the complexity of some algorithms to obtain this representation is analyzed. Moreover, some properties and constructions of new codes from given ones in terms of this representation are described. Algorithms to compute the minimum distance of binary nonlinear codes, based on known algorithms for linear codes, are also established, along with an algorithm to decode such codes. All results are written in such a way that they can be easily transformed into algorithms, and the performance of these algorithms is evaluated
In this paper we show the usability of the Gray code with constant weight words for computing linear...
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of give...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Combinatorics, Coding and Security Group (CCSG)A binary nonlinear code can be represented as a union...
Treball inclòs a la publicació que recull les contribucions al XIII Encuentro de Álgebra Computacion...
Linear codes are generally easier to construct and correct errors than nonlinear codes. However, for...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
We present some upper bounds on the size of nonlinear codes and their restriction to systematic code...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
A class of nonlinear binary cyclic codes of length n=m2m, constant weight w=m2m-1, and minimum dista...
A systematic nonlinear code having length 15, minimum distance 5, and 256 code words is given in Boo...
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In thispap...
In this work, we study the computational complexity of the Minimum Distance Code Detection problem. ...
This paper introduces a new class of nonlinear binary codes. For each l = 2, 3,… we present a code w...
In this paper we show the usability of the Gray code with constant weight words for computing linear...
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of give...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...
Combinatorics, Coding and Security Group (CCSG)A binary nonlinear code can be represented as a union...
Treball inclòs a la publicació que recull les contribucions al XIII Encuentro de Álgebra Computacion...
Linear codes are generally easier to construct and correct errors than nonlinear codes. However, for...
Using some known techniques, several new binary linear codes are constructed, i.e., codes with a gre...
All linear binary codes with minimum distance 8 and codimension up to 14 and all codes with minimum ...
We present some upper bounds on the size of nonlinear codes and their restriction to systematic code...
Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C ...
A class of nonlinear binary cyclic codes of length n=m2m, constant weight w=m2m-1, and minimum dista...
A systematic nonlinear code having length 15, minimum distance 5, and 256 code words is given in Boo...
It has been well-known that the class of quasi-cyclic (QC) codes contain many good codes. In thispap...
In this work, we study the computational complexity of the Minimum Distance Code Detection problem. ...
This paper introduces a new class of nonlinear binary codes. For each l = 2, 3,… we present a code w...
In this paper we show the usability of the Gray code with constant weight words for computing linear...
In this paper, we give a natural way of deciding whether a given cyclic code contains a word of give...
Tables with lower and upper bounds for dmax ( n,k), the maximum possible minimum distance of a binar...