Algorithms for construction of optimal and almost-optimal length-restricted codes

Abstract

Summary form only given. We present a parallel algorithm for the construction of minimum redundancy length-restricted codes that is based on the package-merge algorithm of Larmore and Hirschberg (1990). Our algorithm constructs a length-restricted code in O(L) time with n processors on a CREW PRAM. Thus our algorithm has the same time-processor product as the sequential algorithm of (1990). We also consider the problem of constructing the almost-optimal length-restricted codes.

DOI: 10.1109/DCC.2005.12

Extracted Key Phrases

Cite this paper

@article{Karpinski2005AlgorithmsFC, title={Algorithms for construction of optimal and almost-optimal length-restricted codes}, author={Marek Karpinski and Yakov Nekrich}, journal={Data Compression Conference}, year={2005}, pages={464-} }