On algebraic methods in covering radius problems

I. Honkala, S. Litsyn, A. Tietäväinen

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

Abstract

We discuss how characters of finite fields and exponential sums can be applied to covering radius problems. In particular we study the covering radius of BCH codes, and upper bounds on the covering radius of a code with a given dual distance.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 11th International Symposium, AAECC, Proceedings
EditorsGerard Cohen, Marc Giusti, Teo Mora
PublisherSpringer Verlag
Pages21-32
Number of pages12
ISBN (Print)9783540601142
StatePublished - 1995
Event11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995 - Paris, France
Duration: 17 Jul 199522 Jul 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume948
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1995
Country/TerritoryFrance
CityParis
Period17/07/9522/07/95

Fingerprint

Dive into the research topics of 'On algebraic methods in covering radius problems'. Together they form a unique fingerprint.

Cite this