ATE93105T1 - Verfahren und vorrichtung zur dekodierung eines fehlerverbesserungskodes. - Google Patents

Verfahren und vorrichtung zur dekodierung eines fehlerverbesserungskodes.

Info

Publication number
ATE93105T1
ATE93105T1 AT85900195T AT85900195T ATE93105T1 AT E93105 T1 ATE93105 T1 AT E93105T1 AT 85900195 T AT85900195 T AT 85900195T AT 85900195 T AT85900195 T AT 85900195T AT E93105 T1 ATE93105 T1 AT E93105T1
Authority
AT
Austria
Prior art keywords
decoding
error correction
correction code
code
error
Prior art date
Application number
AT85900195T
Other languages
English (en)
Inventor
Shinya Ozaki
Kentaro Odaka
Tadashi Fukami
Original Assignee
Sony Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from JP24052583A external-priority patent/JPH0628343B2/ja
Priority claimed from JP1983198079U external-priority patent/JPS60104947U/ja
Application filed by Sony Corp filed Critical Sony Corp
Priority claimed from EP85900195A external-priority patent/EP0167627B1/de
Application granted granted Critical
Publication of ATE93105T1 publication Critical patent/ATE93105T1/de

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/1525—Determination and particular use of error location polynomials
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/158—Finite field arithmetic processing
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2903—Methods and arrangements specifically for encoding, e.g. parallel encoding of a plurality of constituent codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
    • H03M13/2909—Product codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
    • H03M13/2927—Decoding strategies
    • H03M13/293—Decoding strategies with erasure setting
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
    • H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
    • H03M13/1515—Reed-Solomon codes

Landscapes

  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Algebra (AREA)
  • General Physics & Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Error Detection And Correction (AREA)
AT85900195T 1983-12-20 1984-12-19 Verfahren und vorrichtung zur dekodierung eines fehlerverbesserungskodes. ATE93105T1 (de)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
JP24052583A JPH0628343B2 (ja) 1983-12-20 1983-12-20 積符号の復号方法
JP1983198079U JPS60104947U (ja) 1983-12-23 1983-12-23 エラ−訂正復号器
EP85900195A EP0167627B1 (de) 1983-12-20 1984-12-19 Verfahren und vorrichtung zur dekodierung eines fehlerverbesserungskodes
PCT/JP1984/000603 WO1985002958A1 (fr) 1983-12-20 1984-12-19 Procede et appareil de decodage d'un code de correction d'erreur

Publications (1)

Publication Number Publication Date
ATE93105T1 true ATE93105T1 (de) 1993-08-15

Family

ID=27228427

Family Applications (1)

Application Number Title Priority Date Filing Date
AT85900195T ATE93105T1 (de) 1983-12-20 1984-12-19 Verfahren und vorrichtung zur dekodierung eines fehlerverbesserungskodes.

Country Status (2)

Country Link
AT (1) ATE93105T1 (de)
HU (1) HU199046B (de)

Also Published As

Publication number Publication date
HUT37531A (en) 1985-12-28
HU199046B (en) 1989-12-28

Similar Documents

Publication Publication Date Title
DE3483375D1 (de) Verfahren und system zur fehlerkorrektur.
DE3583819D1 (de) Verfahren und vorrichtung zur erzeugung eines lauflaengenbegrenzten kodes.
DE3587993D1 (de) Verfahren und Gerät zur Natursprachenverarbeitung.
DE3280110D1 (de) Ionenstrahl-bearbeitungsapparat und methode zur korrektur von maskenfehlern.
DE3587535D1 (de) Verfahren und vorrichtung zur numerischen datenkodierung.
DE3586708D1 (de) Verfahren zur fehlererkennung und -korrektur durch mehrheitsentscheidung.
DE69031294D1 (de) Einrichtung und Verfahren zur Fehlererkennung und Fehlerkorrektur
DE69031099D1 (de) Verfahren und Vorrichtung zur Erkennung und Korrektur von Rechtschreibfehlern
DE69107034D1 (de) Verfahren zur erhöhung der genauigkeit in einem strahlentherapie-apparat.
DE3485849D1 (de) Verfahren zur regenerierung eines desaktivierten katalysators.
DE3483434D1 (de) Verfahren und geraet zur bearbeitung eines defekten speichers.
DE3382285D1 (de) Verfahren und vorrichtung zur koordination von verteilten untersystemen.
DE3481547D1 (de) Verfahren zur kalibrierung eines reflektometers.
DE69021660D1 (de) Verfahren und Vorrichtung zur Korrektur von Synchronisierfehlern für eine Mehrfachbildwiedergabe.
DE3483344D1 (de) Verfahren zur reinigung von lpf-ha.
DE3576779D1 (de) Verfahren und vorrichtung zur bildsignalkodierung und -dekodierung.
DE3382177D1 (de) Verfahren und vorrichtung zur herstellung eines strichkodierten etiketts.
DE3485064D1 (de) Verfahren zur abtrennung eines chlortoluolisomers.
DE3674142D1 (de) Verfahren zur behandlung eines gases.
DE69618930D1 (de) Verfahren und vorrichtung zur fehlerkorrekturkodierung und-dekodierung
DE3280052D1 (de) Verfahren und vorrichtung zur fehlerkorrektur in einer datenverarbeitungsanlage.
DE69028975D1 (de) BCH-Kode-Dekodierer und Verfahren zur Dekodierung eines BCH-Kodes
DE3484923D1 (de) Verfahren zur reinigung eines kautschuks.
DE3382229D1 (de) Verfahren und vorrichtung zur kodierung und dekodierung eines videosignals.
DE69433050D1 (de) Verfahren zur Erzeugung eines Fehlerprüfkodes und Kodeverarbeitungsschaltkreis

Legal Events

Date Code Title Description
UEP Publication of translation of european patent specification
REN Ceased due to non-payment of the annual fee