Coding method for discrete noiseless channels with input constraints

Simple item page
dc.citation.issueNumber13en_US
dc.citation.spage20en_US
dc.citation.volumeNumber25en_US
dc.contributor.authorArıkan, Erdalen_US
dc.coverage.spatialKobe, Japanen_US
dc.date.accessioned2016-02-08T12:02:39Zen_US
dc.date.available2016-02-08T12:02:39Zen_US
dc.date.issued1988en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.descriptionDate of Conference: 19-24 June 1988en_US
dc.descriptionConference Name: IEEE International Symposium on Information Theory, ISIT 1988en_US
dc.description.abstractSummary form only given. Two coding algorithms for discrete noiseless channels with input constraints have been analyzed. The first algorithm, which requires infinite-precision arithmetic and is mainly of theoretical interest, can achieve rates as high as channel capacity. The second algorithm is based on the same ideas as the first, but it is much more practical since it uses only finite-precision, floating-point arithmetic. The algorithms are sequential in nature and do not use tables to encode data; as a result, memory requirements are minimal. Experimental results for the finite-precision algorithm have been obtained for the [2, 7] run-length constrained magnetic channel, the charge-constrained channel with a maximum disparity of three, and the telegraphy channel. In the worst of these three cases, encoding at a rate within 0.65% of the capacity was achieved using a precision of only 8 bits. The catastrophic-error-propagation problem was considered, and it was found that, with a slight amendment, the above algorithms can avoid this problem.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T12:02:39Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1988en
dc.identifier.urihttp://hdl.handle.net/11693/27838
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.source.titleProceedings of the IEEE International Symposium on Information Theory, ISIT 1988en_US
dc.subjectCodes, symbolic encodingen_US
dc.subjectCatastrophic error propagation problemen_US
dc.subjectCoding algorithmsen_US
dc.subjectDiscrete noiseless channelsen_US
dc.subjectFinite precision algorithmen_US
dc.subjectInformation theoryen_US
dc.titleCoding method for discrete noiseless channels with input constraintsen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
bilkent-research-paper.pdf
Size:
68.58 KB
Format:
Adobe Portable Document Format
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering