Výsledky vyhledávání - "Algebraic decoding algorithm"

A Class of Composite Codes with Minimum Distance 8: A class of composite codes with minimum distance 8

Autoři: Boyarinov, I. Martin, I. Honary, B.

Zdroj: Problems of Information Transmission. 37:353-364

Témata: error correction, Burst-correcting codes, Decoding, Analysis of algorithms and problem complexity, 0102 computer and information sciences, 02 engineering and technology, composite codes, burst correction, 01 natural sciences, linear codes, algebraic decoding algorithm, combinational-circuit decoding complexity, Golay code, 0202 electrical engineering, electronic engineering, information engineering, Linear codes (general theory)

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/poit/poit37.html#BoyarinovMH01
https://link.springer.com/article/10.1023/A:1013827518409

Algebraic decoding of the ternary (13,7,5) quadratic residue code: Algebraic decoding of the ternary (13, 7, 5) quadratic residue code

Autoři: J.F. Humphreys

Zdroj: IEEE Transactions on Information Theory. 38:1122-1125

Témata: ternary quadratic residue code, 0508 media and communications, algebraic decoding algorithm, Decoding, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Cyclic codes

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/62597
https://doi.org/10.1109/18.135652
http://ieeexplore.ieee.org/document/135652/
https://dblp.uni-trier.de/db/journals/tit/tit38.html#Humphreys92
https://ieeexplore.ieee.org/document/135652/

Algebraic decoding of the Zetterberg codes

Autoři: Dodunekov, S.M. (1) Nilsson, J.E.M.

Zdroj: IEEE Transactions on Information Theory. 38:1570-1573

Témata: time complexity, double-error correcting binary linear codes, algebraic decoding algorithm, Other types of codes, Decoding, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, space complexity, Zetterberg codes, 01 natural sciences, Linear codes (general theory)

Popis souboru: application/xml

Přístupová URL adresa: http://ieeexplore.ieee.org/document/149509/
https://elib.dlr.de/33872/
https://ieeexplore.ieee.org/document/149509/
https://dlnext.acm.org/doi/10.1109/18.149509
https://dblp.uni-trier.de/db/journals/tit/tit38.html#DodunekovN92
https://core.ac.uk/display/30966347
https://elib.dlr.de/33872/

Efficient root finding of polynomials over fields of characteristic 2

Autoři: Bhaskar Biswas Vincent Herbert The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Bhaskar Biswas Vincent Herbert The Pennsylvania State University CiteSeerX Archives

Zdroj: http://hal.inria.fr/docs/00/62/69/97/PDF/tbz.pdf.

Témata: Worst-case complexity, Code-based public-key cryptography, Linearized polynomial, Berlekamp Trace Algorithm, Error locator polynomial, Algebraic decoding algorithm, Binary Goppa codes

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.393.4371; http://hal.inria.fr/docs/00/62/69/97/PDF/tbz.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.393.4371
http://hal.inria.fr/docs/00/62/69/97/PDF/tbz.pdf

Efficient Root Finding of Polynomials over Fields of Characteristic 2.

Autoři: Biswas, Bhaskar Herbert, Vincent Security, Cryptology and Transmissions (SECRET) a další

Přispěvatelé: Biswas, Bhaskar Herbert, Vincent Security, Cryptology and Transmissions (SECRET) a další

Zdroj: https://hal.archives-ouvertes.fr/hal-00626997 ; 2009.

Témata: Binary Goppa codes, Worst-case complexity, Code-based public-key cryptography, Linearized polynomial, Berlekamp Trace Algorithm, Error locator polynomial, Algebraic decoding algorithm, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]

Relation: hal-00626997; https://hal.archives-ouvertes.fr/hal-00626997; https://hal.archives-ouvertes.fr/hal-00626997/document; https://hal.archives-ouvertes.fr/hal-00626997/file/tbz.pdf

Dostupnost: https://hal.archives-ouvertes.fr/hal-00626997
https://hal.archives-ouvertes.fr/hal-00626997/document
https://hal.archives-ouvertes.fr/hal-00626997/file/tbz.pdf

On algebraic decoding of the \(\mathbb{Z}_4\)-linear Calderbank-McGuire code

Autoři: Rong, Chunming Helleseth, Tor Lahtonen, Jyrki

Témata: \(\mathbb{Z}_4\)-linear code, algebraic decoding algorithm, Decoding, Linear codes (general theory)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1365311