The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 19, 2016

Filed:

Sep. 03, 2009
Applicants:

Eran Sharon, Rishon Lezion, IL;

Idan Alrod, Herzliya, IL;

Simon Litsyn, Giv'at Shmuel, IL;

Inventors:

Eran Sharon, Rishon Lezion, IL;

Idan Alrod, Herzliya, IL;

Simon Litsyn, Giv'at Shmuel, IL;

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H03M 13/11 (2006.01); H03M 13/37 (2006.01); G06F 11/10 (2006.01); H03M 13/00 (2006.01);
U.S. Cl.
CPC ...
H03M 13/1174 (2013.01); G06F 11/1068 (2013.01); H03M 13/1105 (2013.01); H03M 13/1157 (2013.01); H03M 13/3707 (2013.01); H03M 13/6306 (2013.01); H03M 13/6362 (2013.01); H03M 13/6502 (2013.01);
Abstract

k information bits are encoded according to a code with which is associated a parity check matrix H that has n columns. The entire resulting codeword is stored in a storage medium. At least n'<n bits of a representation of the codeword are read from the storage medium and an attempt is made to decode only the n′ bits using a matrix H′ that has fewer columns than H. Typically, H has m=n−k rows and H′ has m−(n−n′) rows and n′ columns. If the attempt fails, one or more additional bits are read from the storage medium, if necessary, and are combined with the n′ bits, and the decoding attempt is repeated using a matrix H′″ that has more columns than H′.


Find Patent Forward Citations

Loading…