ROBUST TRANSMISSION OF UNBOUNDED STRINGS USING FIBONACCI REPRESENTATIONS

被引：79
作者：
APOSTOLICO, A
FRAENKEL, AS
机构：
[1] WEIZMANN INST SCI, DEPT APPL MATH, IL-76100 REHOVOT, ISRAEL
[2] UNIV CALGARY, DEPT MATH & STAT, CALGARY T2N 1N4, ALBERTA, CANADA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1987年 / 33卷 / 02期
关键词：
CODES; SYMBOLIC - MATHEMATICAL TECHNIQUES - Polynomials;
D O I：
10.1109/TIT.1987.1057284
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Families of Fibonacci codes and Fibonacci representations are defined. Their main attributes are robustness, manifesting itself by the local containment of errors; and simple encoding and decoding. The main application explored is the transmission of binary strings in which the length is in an unknown range. Robust Fibonacci representations are used instead of the conventional error-sensitive logarithmic ramp representation. Though the former is asymptotically longer than the latter, the former is actually shorter for very large initial segments of integers.
引用
收藏
页码：238 / 245
页数：8
相关论文
共 16 条
[1]  
Bentley J. L., 1976, Information Processing Letters, V5, P82, DOI 10.1016/0020-0190(76)90071-5
[2]  
Cassels J.W.S., 1957, INTRO DIOPHANTINE AP
[3]  
ELIAS P, 1975, IEEE T INFORM THEORY, V21, P194, DOI 10.1109/TIT.1975.1055349
[4]   ECONOMICAL ENCODING OF COMMAS BETWEEN STRINGS [J].
EVEN, S ;
RODEH, M .
COMMUNICATIONS OF THE ACM, 1978, 21 (04) :315-317
[5]  
Even S., 1979, GRAPH ALGORITHMS
[6]   SYSTEMS OF NUMERATION [J].
FRAENKEL, AS .
AMERICAN MATHEMATICAL MONTHLY, 1985, 92 (02) :105-114
[7]  
FRAENKEL AS, UNPUB ROBUST UNIVERS
[8]  
GALLAGER RG, 1968, INFORMTION THEORY RE
[9]   SYNCHRONIZATION OF BINARY MESSAGES [J].
GILBERT, EN .
IRE TRANSACTIONS ON INFORMATION THEORY, 1960, 6 (04) :470-477
[10]   MAXIMAL PREFIX-SYNCHRONIZED CODES [J].
GUIBAS, LJ ;
ODLYZKO, AM .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1978, 35 (02) :401-418
12