NDLI: Semiconstrained systems

Content Provider	IEEE Xplore Digital Library
Author	Elishco, O. Meyerovitch, T. Schwartz, M.
Copyright Year	2015
Description	Author affiliation: Dept. of Math., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel (Meyerovitch, T.) \|\| Electr. & Comput. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel (Elishco, O.; Schwartz, M.)
Abstract	When transmitting information over a noisy channel, two approaches are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the errors are data dependent and devising a constrained-coding scheme that eliminates all offending data patterns. In this paper we analyze a middle road, which we call a semiconstrained system. In such a model, which is an extension of the channel with cost constraints, we do not eliminate the error-causing sequences entirely, but rather restrict the frequency in which they appear. We address several key issues in this study. The first is proving closed-form bounds on the capacity which allow us to bound the asymptotics of the capacity. In particular, we bound the rate at which the capacity of the semiconstrained (0, k)-RLL tends to 1 as k grows. The second key issue is devising efficient encoding and decoding procedures that asymptotically achieve capacity with vanishing error. Finally, we consider delicate issues involving the continuity of the capacity and a relaxation of the definition of semiconstrained systems.
Starting Page	246
Ending Page	250
File Size	137520
Page Count	5
File Format	PDF
ISSN	21578117
e-ISBN	9781467377041
DOI	10.1109/ISIT.2015.7282454
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-06-14
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Decoding Markov processes Channel coding Convergence Upper bound Capacity planning
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On lower bounds for the capacity of deletion channels

On the capacity of a channel with action-dependent state and reversible input

Asymptotic convergence of dual-tree entropy codes

A new bound on the capacity of the binary deletion channel with high deletion probabilities

Capacity Upper Bounds for the Deletion Channel

Capacity, mutual information, and coding for finite-state Markov channels

Capacity of a class of semi-deterministic primitive relay channels

On the zero-error capacity threshold for deletion channels

On the capacity of the noncausal relay channel

Semiconstrained systems

Similar Documents

On lower bounds for the capacity of deletion channels

On the capacity of a channel with action-dependent state and reversible input

Asymptotic convergence of dual-tree entropy codes

A new bound on the capacity of the binary deletion channel with high deletion probabilities

Capacity Upper Bounds for the Deletion Channel

Capacity, mutual information, and coding for finite-state Markov channels

Capacity of a class of semi-deterministic primitive relay channels

On the zero-error capacity threshold for deletion channels

On the capacity of the noncausal relay channel

Semiconstrained systems