| dc.contributor.author | Arıkan, E. | en_US |
| dc.date.accessioned | 2016-02-08T10:56:42Z | |
| dc.date.available | 2016-02-08T10:56:42Z | |
| dc.date.issued | 1990 | en_US |
| dc.identifier.issn | 0018-9448 | |
| dc.identifier.uri | http://hdl.handle.net/11693/26222 | |
| dc.description.abstract | An implementation of Elias coding for input-restricted channels is presented and analyzed. This is a variable-to-fixed length coding method that uses finite-precision arithmetic and can work at rates arbitrarily close to channel capacity as the precision is increased. The method offers a favorable tradeoff between complexity and coding efficiency. For example, in experiments with the 12, 7] runlength constrained channel, a coding efficiency of 0.9977 is observed, which is significantly better than what is achievable by other known methods of comparable complexity. © 1990 IEEE | en_US |
| dc.language.iso | English | en_US |
| dc.source.title | IEEE Transactions on Information Theory | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1109/18.50383 | en_US |
| dc.subject | Information Theory--Communication Channels | en_US |
| dc.title | An implementation of Elias coding for input-restricted channels | en_US |
| dc.type | Article | en_US |
| dc.department | Department of Electrical and Electronics Engineering | |
| dc.citation.spage | 162 | en_US |
| dc.citation.epage | 165 | en_US |
| dc.citation.volumeNumber | 36 | en_US |
| dc.citation.issueNumber | 1 | en_US |
| dc.identifier.doi | 10.1109/18.50383 | en_US |
| dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
