Antoine Valembois

According to our database1, Antoine Valembois authored at least 9 papers between 2001 and 2004.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2004
Sphere-packing bounds revisited for moderate block lengths.
IEEE Trans. Inf. Theory, 2004

Box and match techniques applied to soft-decision decoding.
IEEE Trans. Inf. Theory, 2004

On soft-input soft-output decoding using "box and match" techniques.
IEEE Trans. Commun., 2004

Reliability-based decoding of Reed-Solomon codes using their binary image.
IEEE Commun. Lett., 2004

2002
A Comparison between "Most-Reliable-Basis Reprocessing" Strategies.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

Box and match soft decision decoding of linear block codes with iterative information set reduction.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
An improved method to compute lists of binary vectors that optimize a given weight function with application to soft-decision decoding.
IEEE Commun. Lett., 2001

Detection and recognition of a binary linear code.
Discret. Appl. Math., 2001

Generation of binary vectors that optimize a given weight function with application to soft-decision decoding.
Proceedings of the 2001 IEEE Information Theory Workshop, 2001


  Loading...