We study the decoding of permutation codes obtained from distance preserving maps and distance increasing maps from Hamming space. We provide efficient algorithms for estimating the q-ary digits of the Hamming space so that decoding can be performed in the Hamming space
Abstract-A frequency permutation array (FPA) of length n = = m.). and distance d is a set of permuta...
It is shown that minimum distance decoding of linear codes is accomplished by generating all codewor...
A set of linearly constrained permutation matrices are proposed for constructing a class of permutat...
Abstract—We study the decoding of permutation codes ob-tained from distance preserving maps and dist...
Abstract—Mappings of the set of binary vectors of a fixed length to the set of permutations of the s...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
A new decoding method is presented for permutation codes obtained from distance-preserving mapping a...
We present results for Distance Preserving Mappings (DPMs) for permutation codes that can be used fo...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
For an error-correcting code and a distance bound, the list decoding problem is to compute all the c...
Several structural and distance properties of the class of codes are derived and utilized in develop...
Abstract: A multilevel construction is introduced to create distance-preserving mappings from binary...
Abstract: A new way of looking at permutation distance-preserving mappings (DPMs) is presented by ma...
Abstract—A frequency permutation array (FPA) of length and distance is a set of permutations on a m...
A mapping of k-bit strings into n-bit strings is called an (α,β)-map if k-bit strings which are more...
Abstract-A frequency permutation array (FPA) of length n = = m.). and distance d is a set of permuta...
It is shown that minimum distance decoding of linear codes is accomplished by generating all codewor...
A set of linearly constrained permutation matrices are proposed for constructing a class of permutat...
Abstract—We study the decoding of permutation codes ob-tained from distance preserving maps and dist...
Abstract—Mappings of the set of binary vectors of a fixed length to the set of permutations of the s...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
A new decoding method is presented for permutation codes obtained from distance-preserving mapping a...
We present results for Distance Preserving Mappings (DPMs) for permutation codes that can be used fo...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
For an error-correcting code and a distance bound, the list decoding problem is to compute all the c...
Several structural and distance properties of the class of codes are derived and utilized in develop...
Abstract: A multilevel construction is introduced to create distance-preserving mappings from binary...
Abstract: A new way of looking at permutation distance-preserving mappings (DPMs) is presented by ma...
Abstract—A frequency permutation array (FPA) of length and distance is a set of permutations on a m...
A mapping of k-bit strings into n-bit strings is called an (α,β)-map if k-bit strings which are more...
Abstract-A frequency permutation array (FPA) of length n = = m.). and distance d is a set of permuta...
It is shown that minimum distance decoding of linear codes is accomplished by generating all codewor...
A set of linearly constrained permutation matrices are proposed for constructing a class of permutat...
DOI
Add to ORKG