Add to ORKGSlepians permutation codes are investigated in detail. In particular we optimize the initial vector and derive all dominating codes in dimension n 2 6. With the exception of the simplex and biorthogonal codes - which are always included as special cases of permutation codes - there are probably no further good codes in higher dimensions
This paper deals with permutation codes. These codes have a main application in error correction in ...
<p>Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entr...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
International audienceIn this paper, we show a manner to use properties of the permutation group on ...
Scientific articles investigating properties and estimates of the number of so-called complete permu...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
A set of linearly constrained permutation matrices are proposed for constructing a class of permutat...
There are many analogies between subsets and permutations of a set, and in particular between sets o...
There are many analogies between subsets and permutations of a set, and in particular between sets o...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
Permutation codes have been extensively investigated, both because of their intrinsic mathematical i...
Permutation codes have been extensively investigated, both because of their intrinsic mathematical i...
This paper deals with permutation codes. These codes have a main application in error correction in ...
This paper deals with permutation codes. These codes have a main application in error correction in ...
<p>Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entr...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
International audienceIn this paper, we show a manner to use properties of the permutation group on ...
Scientific articles investigating properties and estimates of the number of so-called complete permu...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...
A set of linearly constrained permutation matrices are proposed for constructing a class of permutat...
There are many analogies between subsets and permutations of a set, and in particular between sets o...
There are many analogies between subsets and permutations of a set, and in particular between sets o...
AbstractIn this paper we introduce and study a class of tableaux which we call permutation tableaux;...
Permutation codes have been extensively investigated, both because of their intrinsic mathematical i...
Permutation codes have been extensively investigated, both because of their intrinsic mathematical i...
This paper deals with permutation codes. These codes have a main application in error correction in ...
This paper deals with permutation codes. These codes have a main application in error correction in ...
<p>Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entr...
AbstractThere are many analogies between subsets and permutations of a set, and in particular betwee...