Foto dell'editore

Algebraic Soft- and Hard-Decision Decoding of Generalized Reed-Solomon and Cyclic Codes

Alexander Zeh

ISBN 10: 3844022880 / ISBN 13: 9783844022889
Editore: Shaker Verlag Okt 2013, 2013
Nuovi Condizione: Neu Buch
Da Rhein-Team Lörrach Ivano Narducci e.K. (Lörrach, Germania)

Libreria AbeBooks dal 11 gennaio 2012

Valutazione Libreria 5 stelle

Quantità: 1

Compra nuovo
Prezzo: EUR 48,80 Convertire valuta
Spedizione: EUR 4,95 Da: Germania a: Italia Destinazione, tempi e costi
Aggiungere al carrello

Riguardo questo articolo

Neuware - Two challenges in algebraic coding theory are addressed within this dissertation.The first one is the efficient hard- and soft-decision decoding of GeneralizedReed--Solomon codes over finite fields in Hamming metric. The motivation forthis more than 50 years old problem was renewed by the discovery of apolynomial-time interpolation-based decoding principle up to the Johnson radiusby Guruswami and Sudan at the end of the 20th century. First syndrome-basederror/erasure decoding approaches by Berlekamp--Massey and Sugiyama--Kasahara--Hirasawa--Namekawa for Generalized Reed--Solomon codes weredescribed by a Key Equation, i.e., a polynomial description of the decodingproblem. The reformulation of the interpolation-based approach in terms of KeyEquations is a central topic of this thesis. This contribution covers several aspectsof Key Equations for Generalized Reed--Solomon codes for both, thehard-decision variant by Guruswami--Sudan, as well as for the soft-decisionapproach by Kötter--Vardy. The obtained systems of linear homogeneousequations are structured and efficient decoding algorithms are developed. Thesecond topic of this dissertation is the formulation and the decoding up to lowerbounds on the minimum Hamming distance of linear cyclic block codes overfinite fields. The main idea is the embedding of a given cyclic code into a cyclic(generalized) product code. Therefore, we give an extensive description of cyclicproduct codes and code concatenation. We introduce cyclic generalized productcodes and indicate how they can be used to bound the minimum distance.Necessary and sufficient conditions for lowest-rate non-primitive binary cycliccodes of minimum distance two and a sufficient condition for binary cyclic codesof minimum distance three are worked out and their relevance for the embedding-technique is outlined. Furthermore, we give quadratic-time syndrome-basederror/erasure decoding algorithms up to some of our proposed bounds. 155 pp. Englisch. Codice inventario libreria 9783844022889

Fare una domanda alla libreria

Dati bibliografici

Titolo: Algebraic Soft- and Hard-Decision Decoding ...

Casa editrice: Shaker Verlag Okt 2013

Data di pubblicazione: 2013

Legatura: Buch

Condizione libro:Neu

Descrizione libreria

Visita la pagina della libreria

Condizioni di vendita:

Allgemeine Geschäftsbedingungen (abebooks.de)

Rhein-Team Lörrach, Inhaber Ivano Narducci e.K., Mühlestr. 1
D-79539 Lörrach, nachfolgend als Verkäufer bezeichnet.

§ 1 Allgemeines, Begriffsbestimmungen

(1) Der Verkäufer bietet unter dem Nutzernamen rhein-team unter der Plattform abebooks.de insbesondere Bücher an. Die folgenden Allgemeinen Geschäftsbedingungen (AGB) gelten für die Geschäftsbeziehung zwischen dem Verkäufer und dem Kunden in ihrer zum Zeitpunkt der Bestellung gültigen Fassung. Ferne...

Ulteriori informazioni
Condizioni di spedizione:

Die Ware wird innerhalb von 1-3 Tagen nach Bestelleingang verschickt. Bitte entnehmen Sie den voraussichtlichen Liefertermin Ihrer Bestellbestätigung. Die Versandkostenpauschalen basieren auf Durchschnittswerten für 1 kg schwere Bücher. Über abweichende Kosten (z.B. wegen eines sehr schweren Buches) werden Sie gegebenenfalls vom Verkäufer informiert.


Informazioni dettagliate sul venditore

Tutti i libri della libreria

Metodi di pagamento
accettati dalla libreria

Visa Mastercard American Express Carte Bleue

Assegno PayPal