Low-complexity, capacity-achieving code for communication...

Details Low-complexity, capacity-achieving code for communication... Low-complexity, capacity-achieving code for communication...

2004-11-30

2008-11-25

Perveen, Rehana (Department: 2112)

Error detection/correction and fault detection/recovery

Pulse or data error handling

Digital data error correction

Reexamination Certificate

active

07458003

ABSTRACT:
Methods and apparatuses to encode and decode information. One apparatus may use an encoder with a relatively low complexity, capacity-achieving code. The code may allow information to be reliably transmitted and received across a noisy medium or channel.

REFERENCES:
patent: 5446747 (1995-08-01), Berrou
patent: 6307487 (2001-10-01), Luby
patent: 6320520 (2001-11-01), Luby
patent: 6373406 (2002-04-01), Luby
patent: 6567465 (2003-05-01), Goldstein et al.
patent: 6614366 (2003-09-01), Luby
patent: 6633856 (2003-10-01), Richardson et al.
patent: 7058873 (2006-06-01), Song et al.
patent: 7089477 (2006-08-01), Divsalar et al.
patent: 7116710 (2006-10-01), Jin et al.
patent: 7162684 (2007-01-01), Hocevar
patent: 2005/0149845 (2005-07-01), Shin et al.
patent: 2006/0123277 (2006-06-01), Hocevar
patent: 2006/0218460 (2006-09-01), Divsalar et al.
patent: 2007/0011568 (2007-01-01), Hocevar
patent: 2007/0022354 (2007-01-01), Yu et al.
patent: 2007/0025450 (2007-02-01), Jin et al.
Chung et al., “On The Design Of Low-Density Parity-Check Codes Within 0.0045 Db Of The Shannon Limit,”IEEE Commun. Letters, vol. 5, No. 2, Feb. 2001, pp. 58-60.
Gallager, “Low-Density Parity-Check Codes,”Research Monograph 21, The M.I.T. Press, Cambridge, MA, U.S.A., Jul. 1963, 90 pages.
Jin et al., “Irregular Repeat-Accumulate Codes,” InProc. Int. Symp. on Turbo Codes&Related Topics, Brest, France, Sep. 2000, 8 pages.
Luby et al., “Practical Loss-Resilient Codes,” InProc. of the 29th Annual ACM Symp. on Theory of Comp., 1997, pp. 150-159.
Richardson et al., “The Capacity Of Low-Density Parity Check Codes Under Message-Passing Decoding,”IEEE Trans. Inform. Theory, vol. 47, No. 2, Feb. 2001, pp. 599-618.
Shokrollahi, “New Sequences Of Linear Time Erasure Codes Approaching The Channel Capacity,” InApplicable Algebra in Eng., Commun. Comp., 1999, pp. 65-76.
P.Elias, “Coding for two noisy channels,” inInformation Theory, Third London Symposium, 1955, pp. 61-67.
A. Khandekar, “Graph-based codes and iterative decoding,” PhD dissertation, California Institute of Technology, Pasadena, CA 2002, pp. 1-103.
A. Khandekar and R.J. McEliece, “On the complexity of reliable communication on the erasure channel,”Proceedings 2001 IEEE International Symposium on Information Theory(ISIT2001), Washington, D.C., Jun. 2001, p. 1.
M.G. Luby et al., “Efficient erasure correcting codes,”IEEE Trans. on Information Theory, vol. 47 Feb. 2001, pp. 569-584.
Henry D. Pfister, On the Capacity of Finite State Channels and the Analysis of Convolutional Accumulate-m Codes. PhD thesis, University of California, San Diego, CA, Mar. 2003, pp. 1-188.
P. Oswald and A. Shokrollahi, “Capacity-achieving sequences for the erasure channel,”IEEE Trans. on Information Theory, vol. 48, No. 12, Dec. 2002, pp. 3017-3028.
I. Sason and R. Urbanke, “On the complexity of irregular repeat-accumulate codes on the erasure channel,”Proceedings of the Third International Symposium on Turbo Codes and related Topics,Brest, France, Sep. 1-5, 2003, pp. 133-136.
I. Sason and R. Urbanke, “Parity-Check Density versus Performance of Binary Linear Block Codes over Memoryless Symmetric Channels,”IEEE Trans. on Information Theory, vol. 49, No. 7, Jul. 2003, pp. 1611-1635.
A. Shokrollahi, “New sequences of time erasure codes approaching channel capacity,”Proceedings of the 13thInternational Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lectures Notes in Computer Science 1719, Springer Verlag, 1999, pp. 65-76.

Affiliated with

Also associated with

Rating

Low-complexity, capacity-achieving code for communication... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Low-complexity, capacity-achieving code for communication..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-complexity, capacity-achieving code for communication... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4045228