List Decoding of Binary Codes-A Brief Survey of Some Recent Results

The method of, and apparatus for, producing a yarn using a friction spinning device comprising a perforated first friction spinning drum and a second friction spinning drum which can also be perforated. Two fiber feed passages project to the first friction spinning drum and are each supplied by opening assemblies which individualize or individually separate the fibers. The fibers are transported toward the first friction spinning drum using a feed air stream in the fiber feed passages. This feed air stream is produced by the first friction spinning drum which is maintained under sub-pressure. Advantageously, the fiber double-feed to the friction spinning drum permits supplying two different fiber types to the same yarn end. Also, different inclinations of the fibers at the friction spinning drum can be obtained by different inclinations of the fiber feed passages in order to produce yarns of different character.

[1]  Venkatesan Guruswami,et al.  List decoding algorithms for certain concatenated codes , 2000, STOC '00.

[2]  Venkatesan Guruswami,et al.  Concatenated codes can achieve list-decoding capacity , 2008, SODA '08.

[3]  Venkatesan Guruswami,et al.  Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.

[4]  Venkatesan Guruswami,et al.  Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[5]  Venkatesan Guruswami Artin automorphisms, cyclotomic function fields, and folded list-decodable codes , 2009, STOC '09.

[6]  Madhu Sudan List decoding: algorithms and applications , 2000, SIGA.

[7]  Venkatesan Guruswami,et al.  Better Binary List Decodable Codes Via Multilevel Concatenation , 2007, IEEE Transactions on Information Theory.

[8]  Alexander Vardy,et al.  Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[9]  Venkatesan Guruswami,et al.  List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition) , 2005, Lecture Notes in Computer Science.

[10]  Venkatesan Guruswami,et al.  Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[11]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[12]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[13]  Shachar Lovett,et al.  The List-Decoding Size of Reed-Muller Codes , 2008, Electron. Colloquium Comput. Complex..

[14]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[15]  Venkatesan Guruswami,et al.  List decoding of error correcting codes , 2001 .

[16]  Simon Litsyn,et al.  Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[17]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[18]  V. Wei,et al.  Error-Correcting Codes for List Decoding , 1994 .

[19]  Venkatesan Guruswami,et al.  Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.