ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint

Manickam, Shivkumar K and Kashyap, Navin (2018) On Minimum Expected Length Prefix Codes Satisfying a (d, k) Runlength-Limited Constraint. In: 2018 International Symposium on Information Theory and Its Applications (ISITA), 28-31 Oct. 2018, Singapore, pp. 648-652.

[img]
Preview
PDF
ISITA_28-31_2018.pdf

Download (428kB) | Preview
Official URL: https://doi.org/10.23919/ISITA.2018.8664350

Abstract

A prefix code X is said to satisfy the (d, k) runlength- limited (RLL) constraint if all the possible concatenations of the codewords of X satisfy the (d, k) RLL constraint. In this paper, the problem of constructing a minimum expected length prefix code satisfying the (d, k) RLL constraint is studied for certain (d, k) pairs. The question of maximality, with maximality defined relative to the RLL constraint, of these optimal prefix codes is also taken up and answered for some cases.

Item Type: Conference Proceedings
Additional Information: 15th International Symposium on Information Theory and its Applications (ISITA), Singapore, SINGAPORE, OCT 28-31, 2018
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Division of Electrical Sciences > Electrical Communication Engineering > Electrical Communication Engineering - Technical Reports
Depositing User: Id for Latest eprints
Date Deposited: 15 Jul 2019 10:15
Last Modified: 15 Jul 2019 10:15
URI: http://eprints.iisc.ac.in/id/eprint/62909

Actions (login required)

View Item View Item