On polyalphabetic block codes

V. Sidorenko, G. Schmidt, E. Gabidulin, M. Bossert, V. Afanassiev

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

10 Scopus citations

Abstract

A polyalphabetic (or mixed) block code is a set of codewords of finite length, where every symbol of a codeword belongs to its own alphabet. In contrast to previous publications we consider a general case, where we do not assume any algebraic structure of the alphabets and the codes. Upper and lower bounds on the cardinality of a polyalphabetic code with given Hamming distance are obtained. Some constructions of polyalphabetic codes are suggested based on known codes. Encoding and decoding of the polyalphabetic codes, obtained in this way, can be done using encoding and decoding algorithms for the mother code. Using this constructions, codes are obtained, that reach the upper Singleton type bound.

Original languageEnglish
Title of host publicationProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
Pages207-210
Number of pages4
DOIs
StatePublished - 2005
Externally publishedYes
EventIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 - Rotorua, New Zealand
Duration: 29 Aug 20051 Sep 2005

Publication series

NameProceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

Conference

ConferenceIEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005
Country/TerritoryNew Zealand
CityRotorua
Period29/08/051/09/05

Fingerprint

Dive into the research topics of 'On polyalphabetic block codes'. Together they form a unique fingerprint.

Cite this