Abstract: Minimum Hamming distance, dm, has been widely used as the yardstick for the performance of permutation codes (PCs). However, a number of PCs with the same dm and cardinality can have different performances, even if they have the same distance optimality. Since PC is a robust channel coding scheme in power line communications applications, we present a simple and fast ranking method that predicts the relative performance of PCs, by using the information extracted from their Hamming distance distributions. This tool is useful for selecting an efficient PC codebook out of a number of similar ones
We investigate the lossy compression of permutations by analyzing the trade-off between the size of ...
AbstractWireless technology has become a main player in communication through its desirable mobility...
This paper proposes an optimized version of the Hamming code. The paper begins with identifying a se...
Abstract: We report a new concept involving an adaptive mixture of different sets of permutation cod...
We partition permutation sequences into groups to form permutation codes for multiuser communication...
Abstract: A new decoding method is presented for permutation codes obtained from distance-preserving...
Abstract: It has previously been shown that using the combination of permutation codes and M-ary fre...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
Arriving at a good combination of coding andmodulation schemes that can achieve good error correctio...
Abstract: Noise and attenuation, in the form of frequency disturbance, impulsive noise, additive whi...
We present results for Distance Preserving Mappings (DPMs) for permutation codes that can be used fo...
Distributed Arithmetic Coding (DAC) is an effective technique for implementing Slepian-Wolf coding (...
Abstract: Noise and attenuation, in the form of frequency disturbance, impulsive noise, additive whi...
The column Hamming distance of a convolutional code determines the error correction capability when ...
We investigate the lossy compression of permutations by analyzing the trade-off between the size of ...
AbstractWireless technology has become a main player in communication through its desirable mobility...
This paper proposes an optimized version of the Hamming code. The paper begins with identifying a se...
Abstract: We report a new concept involving an adaptive mixture of different sets of permutation cod...
We partition permutation sequences into groups to form permutation codes for multiuser communication...
Abstract: A new decoding method is presented for permutation codes obtained from distance-preserving...
Abstract: It has previously been shown that using the combination of permutation codes and M-ary fre...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
Most papers on permutation codes have concentrated on the minimum Hamming distance of the code. An (...
Arriving at a good combination of coding andmodulation schemes that can achieve good error correctio...
Abstract: Noise and attenuation, in the form of frequency disturbance, impulsive noise, additive whi...
We present results for Distance Preserving Mappings (DPMs) for permutation codes that can be used fo...
Distributed Arithmetic Coding (DAC) is an effective technique for implementing Slepian-Wolf coding (...
Abstract: Noise and attenuation, in the form of frequency disturbance, impulsive noise, additive whi...
The column Hamming distance of a convolutional code determines the error correction capability when ...
We investigate the lossy compression of permutations by analyzing the trade-off between the size of ...
AbstractWireless technology has become a main player in communication through its desirable mobility...
This paper proposes an optimized version of the Hamming code. The paper begins with identifying a se...