Improved Power Decoding of Algebraic Geometry Codes

Sven Puchinger, Johan Rosenkilde, Grigory Solomatov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Power decoding is a partial decoding paradigm for arbitrary algebraic geometry codes for decoding beyond half the minimum distance, which usually returns the unique closest codeword, but in rare cases fails to return anything. The original version decodes roughly up to the Sudan radius, while an improved version decodes up to the Johnson radius, but has so far been described only for Reed-Solomon and one-point Hermitian codes. In this paper we show how the improved version can be applied to any algebraic geometry code.

Original languageEnglish
Title of host publication2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages509-514
Number of pages6
ISBN (Electronic)9781538682098
DOIs
StatePublished - 12 Jul 2021
Externally publishedYes
Event2021 IEEE International Symposium on Information Theory, ISIT 2021 - Virtual, Melbourne, Australia
Duration: 12 Jul 202120 Jul 2021

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2021-July
ISSN (Print)2157-8095

Conference

Conference2021 IEEE International Symposium on Information Theory, ISIT 2021
Country/TerritoryAustralia
CityVirtual, Melbourne
Period12/07/2120/07/21

Keywords

  • Algebraic Geometry Codes
  • Power Decoding

Fingerprint

Dive into the research topics of 'Improved Power Decoding of Algebraic Geometry Codes'. Together they form a unique fingerprint.

Cite this