Sciweavers

118 search results - page 7 / 24
» Permutation codes
Sort
View
CISS
2010
IEEE
14 years 1 months ago
Frame permutation quantization
—Frame permutation quantization (FPQ) is a new vector quantization technique using finite frames. In FPQ, a vector is encoded using a permutation source code to quantize its fra...
Ha Quy Nguyen, Vivek K. Goyal, Lav R. Varshney
TIFS
2008
154views more  TIFS 2008»
14 years 9 months ago
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network...
Juan M. Estévez-Tapiador, Julio Césa...
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 9 months ago
Methods for the Reconstruction of Parallel Turbo Codes
Abstract--We present two new algorithms for the reconstruction of turbo codes from a noisy intercepted bitstream. With these algorithms, we were able to reconstruct various turbo c...
Mathieu Cluzeau, Matthieu Finiasz, Jean-Pierre Til...
ICC
2007
IEEE
102views Communications» more  ICC 2007»
15 years 3 months ago
Quasi-Cyclic Low-Density Parity-Check Codes in the McEliece Cryptosystem
Abstract—In this paper, a new variant of the McEliece cryptosystem, based on Quasi-Cyclic Low-Density Parity-Check (QCLDPC) codes, is studied. In principle, such codes can substi...
Marco Baldi, Franco Chiaraluce, Roberto Garello, F...
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
15 years 3 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom