Amanote Research
Register
Sign In
Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions
IEEE Transactions on Information Theory
- United States
doi 10.1109/tit.2004.838112
Full Text
Open PDF
Abstract
Available in
full text
Categories
Computer Science Applications
Information Systems
Library
Information Sciences
Date
December 1, 2004
Authors
Z. Nagy
K. Zeger
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Related search
Statistical Analysis of Improved Bit-Stuffing Method Based on CAN Bus
DEStech Transactions on Computer Science and Engineering
Run Length Coding for Image Analysis.
General Relations for Quantum Gases in Two and Three Dimensions: Two-Component Fermions
Physical Review A
Coding for Constrained Channels: A Comparison of Two Approaches
IBM Journal of Research and Development
Computer Science
Keyword Stuffing and the Big Three Search Engines
Online Information Review
Computer Science Applications
Information Systems
Library
Information Sciences
Capacity Bounds for the Three-Dimensional (0,1) Run Length Limited Channel
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
A Learning Progression for Geometrical Measurement in One, Two, and Three Dimensions
ETS Research Report Series
Statistics
Probability
Uncertainty
Applied Psychology
Social Psychology
Education
From Classical to Quantum Plasmonics in Three and Two Dimensions
Springer Theses
Statistical Topology of Cellular Networks in Two and Three Dimensions
Physical Review E
