Invention Grant
- Patent Title: Information encoding by shortened Reed-Solomon codes
- Patent Title (中): 通过缩短Reed-Solomon码的信息编码
-
Application No.: US10565280Application Date: 2004-07-21
-
Publication No.: US07398456B2Publication Date: 2008-07-08
- Inventor: Philippe Piret , Philippe Le Bars , Frederic Lehobey
- Applicant: Philippe Piret , Philippe Le Bars , Frederic Lehobey
- Applicant Address: JP Tokyo
- Assignee: Canon Kabushiki Kaisha
- Current Assignee: Canon Kabushiki Kaisha
- Current Assignee Address: JP Tokyo
- Agency: Fitzpatrick, Cella, Harper & Scinto
- Priority: FR0308868 20030721
- International Application: PCT/IB2004/002623 WO 20040721
- International Announcement: WO2005/008900 WO 20050127
- Main IPC: H03M13/00
- IPC: H03M13/00

Abstract:
The present invention concerns an encoding method in which encoding is performed of any information word a of length k in the form of a word ν belonging to a Reed-Solomon code C of dimension k′ and length n′ (with n′−k′=n−k) such that the components of ν′ situated in (n′−n) arbitrary predetermined positions be systematically equal to respective predetermined constants (for example, all zero). The possibility then exists of deleting those components of fixed value to obtain a word ν of length n belonging to a code C, which thus constitutes a code that is shortened with respect to code C. The invention also relates to devices and apparatuses adapted to implement the encoding method. The invention may be used for encoding by means of an algebraic geometric code, when such encoding may be implemented by encoding by means of a plurality of shortened Reed-Solomon codes.
Public/Granted literature
- US20060227017A1 Information encoding by shortened reed-solomon codes Public/Granted day:2006-10-12
Information query
IPC分类: