U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Decoding for algebraic geometric code associated with a fiber product

Patent 7392461 Issued on June 24, 2008. Estimated Expiration Date: Icon_subject January 13, 2025. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Method and apparatus for decoding Reed-Solomon code
Patent #: 5341385
Issued on: 08/23/1994
Inventor: Shirota

Modular implementation for a parallelized key equation solver for linear algebraic codes
Patent #: 5428628
Issued on: 06/27/1995
Inventor: Hassner, et al.

Method and device for detecting and correcting any error in a sequence of numbers
Patent #: 5905739
Issued on: 05/18/1999
Inventor: Piret, et al.

Method and means for computationally efficient error and erasure correction in linear cyclic codes
Patent #: 5942005
Issued on: 08/24/1999
Inventor: Hassner, et al.

Reed-Solomon decoder having a new polynomial arrangement architecture and decoding method therefor
Patent #: 6256763
Issued on: 07/03/2001
Inventor: Oh, et al.

Device and method for coding information and device and method for decoding coded information
Patent #: 6438112
Issued on: 08/20/2002
Inventor: Piret, et al.

Method and device for coding and transmission using a sub-code of a product code
Patent #: 6543021
Issued on: 04/01/2003
Inventor: Piret

Coding device and method, decoding device and method and systems using them
Patent #: 6578170
Issued on: 06/10/2003
Inventor: Piret, et al.

Method of correcting residual errors at the output of a turbodecoder
Patent #: 6578171
Issued on: 06/10/2003
Inventor: Braneci, et al.

Efficient list decoding of Reed-Solomon codes for message recovery in the presence of high noise levels
Patent #: 6631172
Issued on: 10/07/2003
Inventor: Shokrollahi ,   et al.

More ...

Inventors

Assignee

Application

No. 11034009 filed on 01/13/2005

US Classes:

714/785Syndrome computed

Examiners

Primary: Louis-Jacques, Jacques H.
Assistant: Rizk, Sam

Attorney, Agent or Firm

Foreign Patent References

  • WO2004047306 WO 06/01/2004

International Class

H03M 13/00

Abstract

The present invention concerns a method and apparatus of decoding a one-point algebraic geometric code defined on an algebraic curve represented by an equation in X and Z of degree 2μφ in Z, where φ is a strictly positive integer and μ an integer greater than 1, obtained by taking the fiber product of μ component algebraic equations, each of said component equations governing the unknown X and an unknown Yi, where i=0, . . . , μ−1, and being of degree 2φ in Yi. This method comprises the decoding of 2(μ−1)φ “clustered” codes, all defined on the same algebraic curve represented by one of said component equations.

Other References

  • O'Sullivan, “A Generalization of the Berlekamp-Massey-Sakata Algorithm”, http://www-rohan.sdsu.edu/˜mosulliv/research.html, preprint, pp. 1-25, Jun. 2001.
  • Sakata et al., “Generalized Berlekamp-Massey Decoding of algebraic-Geometeric Codes up to Half the Feng-Rao Bound”, IEEE Transactions on Information Theory, vol. 41, No. 6, pp. 1762-1768, Nov. 1995.
  • Skorobogatov et al., “On the Decoding of Algebraic-Geometric Codes”, IEEE Transactions on Information Theory, vol. 36, No. 5, pp. 1051-1060, Sep. 1990.
  • Høholdt et al., “On the Decoding of Algebraic-Geometric Codes”, IEEE Transactions on Information Theory, vol. 41, No. 6, pp. 1589-1614, Nov. 1995.
  • Van Lint, “Algebraic Geometric Codes”, in “Coding Theory and Design Theory”, 1st Part, The IMA Volumes in Mathematics and Its Applications, vol. 20, Springer-Verlag, Berlin, 1990.
  • R.E. Blahut, “Theory and Practice of Error Control Codes”, Addison Wesley, US, XP002272857 pp. 119-123, Chapter 5.8: “The Binary Golay Code”, 1983.
  • R.E. Blahut, “Theory and Practice of Error Control Codes”, Addison Wesley, US, XP002272858, pp. 94-96, Chapter 5.1: “Viewing a Code from an Extension Field”, 1984.
  • S. Miura, “Hyperelliptic Codes II”, 12th Symposium on the Theory of Information and its Applications—SITA '89, Inuyama, Japan, Dec. 1989.
  • H. Stichtenoth, “Algebraic Function Fields and Codes”, Foundations of the Theory of Algebraic Functions Fields, Chapter 1, Springer-Verlag, US, pp. 1-29, 1993.
  • D.A. Leonard, “A Generalized Forney Formula for Algebraic-Geometry Codes”, IEEE Press, US, IEEE Transactions on Information Theory, vol. 42, No. 4, pp. 1263-1268, Jul. 1996.
  • J.H. van Lint et al., “Algebraic Geometry Codes”, Introduction to Coding Theory 3rd Edition, Chapter 10, Springer-Verlag, US, pp. 148-165, 1999.
  • S. Stepanov et al., “Fibre Products of Superelliptic Curves and Codes Therefrom”, Information Theory, Jun. 29, 1997, p. 413.
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$16.95more info
 
Sign InRegister
Username  
Password   
forgot password?