Fibonacci codes for synchronization control

DOI10.1109/TIT.1965.1053772MaRDI QIDQ5519677zbMATH OpenFDO

Authors William H. Kautz

Publication date 1965

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1965.1053772

zbMATH Keywords

information, communication

Cited in

(10)

• On the channel capacity of read/write isolated memory
• Optimal codes from Fibonacci polynomials and secret sharing schemes
• On approximation of stable linear dynamical systems using Laguerre and Kautz functions
• Robust universal complete codes for transmission and compression
• On the complexity of Fibonacci coding
• Matching of initial behavior in time domain approximation
• A SIMPLE ALPHABET-INDEPENDENT FM-INDEX
• Fast enumeration algorithm for words with given constraints on run lengths of ones
• Enumeration of constant-weight run-length limited binary sequences
• The channel capacity of read/write isolated memory

This page was built for publication: Fibonacci codes for synchronization control

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