An improvement to the bit stuffing algorithm

The bit stuffing algorithm is a technique for coding constrained sequences by the insertion of bits into an arbitrary data sequence. This approach was previously introduced and applied to (d,k) constrained codes. Results show that the maximum average rate of the bit stuffing code achieves capacity w...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2005-08, Vol.51 (8), p.2885-2891
Hauptverfasser:	Aviran, S., Siegel, P.H., Wolf, J.K.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithms Applied sciences Binary sequences Bit-stuffing encoder Capacity Codes Coding Coding, codes Constraints Data analysis Eigenvalues and eigenfunctions Exact sciences and technology Information theory Information, signal and communications theory Insertion Interference constraints Intersymbol interference Lifting equipment Magnetic recording Magnetic separation Mathematical analysis Optical recording Shan- non capacity Signal and communications theory Telecommunications and information theory Timing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!