Coded data generation or conversion – Digital code to digital code converters – To or from minimum d.c. level codes
Reexamination Certificate
2007-11-13
2007-11-13
Young, Brian (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from minimum d.c. level codes
C341S059000
Reexamination Certificate
active
11404906
ABSTRACT:
In the coding device and method, m-bit information words are converted into n-bit code words such that the coding rate m
is greater than ⅔. The n-bit code words are divided into a first type and a second type, and into coding states of a first kind and a second kind such that an m-bit information word is converted into an n-bit code word of the first or second kind if the previous m-bit information word was converted into an n-bit code word of the first type and is converted into an n-bit code word of the first kind if the previous m-bit information word was converted into an n-bit code word of the second type. In one embodiment, n-bit code words of the first type end in zero, n-bit code words of the second type end in one, n-bit code words of the first kind start with zero, and n-bit code words of the second kind start with zero or one. Furthermore, in the embodiments, the n-bit code words satisfy a dk-constraint of (1,k) such that a minimum of 1 zero and a maximum of k zeros falls between consecutive ones. The coding device and method are employed to record information on a recording medium and thus create the recording medium. The coding device and method are further employed to transmit information. In the decoding method and apparatus, n-bit code words are decoded into m-bit information words. The decoding involves determining the state of a next n-bit code word, and based on the state determination, the current n-bit code word is converted into an m-bit information word. The decoding device and method are employed to reproduce information from a recording medium, and to receive information transmitted over a medium.
REFERENCES:
patent: 4413251 (1983-11-01), Adler et al.
patent: 4488142 (1984-12-01), Franaszek
patent: 4760378 (1988-07-01), Iketani et al.
patent: 5047767 (1991-09-01), Weathers et al.
patent: 5642113 (1997-06-01), Schouhamer Immink
patent: 5790056 (1998-08-01), Schouhamer Immink
patent: 5859601 (1999-01-01), Moon et al.
patent: 5920272 (1999-07-01), Schouhamer Immink
patent: 5923629 (1999-07-01), Noxon et al.
patent: 6018304 (2000-01-01), Bessios
patent: 6034150 (2000-03-01), Hoyle et al.
patent: 6195025 (2001-02-01), Hassner et al.
patent: 1166225 (1997-11-01), None
patent: 2000-502545 (2000-02-01), None
patent: 2001-195833 (2001-07-01), None
patent: 2003-528417 (2003-09-01), None
patent: PCT 00/21198 (2000-04-01), None
patent: WO-00/20517 (2000-04-01), None
Codes for Mass Data Storage Systems, Kees A. Schouhamer Immink, Institute for Experimental Mathematics, University of Essen, Essen Germany. Published by Shannon Foundation Publishers, The Netherlands, 1999, no month.
European Search Report dated Sep. 23, 2005.
Kees A. Schouhamer Immink, A Rate 4/6 (d=1, k=11) Block-Decodable, Runlength-Limited Code, IEEE Transactions On Information Theory, vol. 42, No. 5, Sep. 1996, pp. 1551-1553.
Birch & Stewart Kolasch & Birch, LLP
LG Electronics Inc.
Young Brian
LandOfFree
Method and apparatus for coding information, method and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for coding information, method and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for coding information, method and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3860439