Name
Abstract | ||
|---|---|---|
In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specifically, using the columns of a parity check matrix of an $[{\it{ n,k,d}}]_{ {q}}$ linear block code, we are able to prove the existence of a permutation code in the symmetric group of degree n, having minimum distance at... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/TIT.2019.2957354 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Parity check codes,Hamming distance,Hamming weight,Generators,Linear codes,Symmetric matrices | Journal | 66 |
Issue | ISSN | Citations |
7 | 0018-9448 | 1 |
PageRank | References | Authors |
0.36 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giacomo Micheli | 1 | 14 | 5.54 |
| Alessandro Neri | 2 | 14 | 6.10 |