On periodic (Partial) unit memory codes with maximum free distance

V. Zyablov, V. Sidorenko

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

9 Citations (Scopus)

Abstract

In this paper we describe two constructions of q-ary (partial) unit memory codes that achieve upper bounds on the free distance. These constructions are based on Reed-Solomon codes. We show that the increase α of the extended row distance of the proposed codes is larger than that for known ones.

Original languageEnglish
Title of host publicationError Control, Cryptology, and Speech Compression - Workshop on Information Protection, Selected Papers
EditorsAndrew Chmora, Stephen B. Wicker
PublisherSpringer Verlag
Pages74-79
Number of pages6
ISBN (Print)9783540582656
DOIs
Publication statusPublished - 1994
Externally publishedYes
EventWorkshop on Information Protection, 1993 - Moscow, Russian Federation
Duration: 6 Dec 19939 Dec 1993

Publication series

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

Conference

ConferenceWorkshop on Information Protection, 1993
Country/TerritoryRussian Federation
CityMoscow
Period6/12/939/12/93

Fingerprint

Dive into the research topics of 'On periodic (Partial) unit memory codes with maximum free distance'. Together they form a unique fingerprint.

Cite this