scientific article; zbMATH DE number 2135156

MaRDI QIDQ4650834zbMATH OpenFDO

Authors Jack Keil Wolf

Publication date 18 February 2005

Mathematics Subject Classification ID

Applications of graph theory (05C90) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• An Improvement to the Bit Stuffing Algorithm
• Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions
• Capacity achieving code constructions for two classes of (d,k) constraints
• On runlength codes
• Improved Bit-Stuffing Bounds on Two-Dimensional Constraints

Cited in

(3)

• A self-adaptive probabilistic packet filtering scheme against entropy attacks in network coding
• An Improvement to the Bit Stuffing Algorithm
• On the Mean Number of Stuffing Bits in a Prefix-Synchronized Code

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650834)