AbstractA Fibonacci coding method using Fibonacci polynomials is introduced. For integers m≥2, x≥1 and n≥1, an m×m matrix Qmn(x), the nth power of Qm(x), is considered as the encoding matrix, where Qm is an m×m matrix whose elements are Fibonacci polynomials. The decoding matrix Qm−n(x) is also introduced. A simple error-detecting criterion and a simple error-correcting method for this class of codes are given. It is shown that the probability of decoding error is almost zero for m large enough. Illustrative examples are provided
Since Shannon's ground-breaking work in 1948, there have been two main development streams of channe...
We propose an improved coding method of quantum key distribution protocols based on a recently propo...
Burrows-Wheeler algorithm (BWA for short) is a lossless data compression scheme, named after authors...
Abstract. Data compression has been widely applied in many data pro-cessing areas. Compression metho...
AbstractFibonacci coding is based on Fibonacci numbers and was defined by Apostolico and Fraenkel (1...
The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two c...
Recent publications advocate the use of various variable length codes for which each codeword consis...
Recent publications advocate the use of various variable length codes for which each codeword consis...
Given the need to improve the efficiency of data transfer, there are requirements to ensure their re...
Given the need to improve the efficiency of data transfer, there are requirements to ensure their re...
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robust...
We implement a decision procedure for answering questions about a class of infinite words that might...
Hill Cipher algorithm is a technique of message encoding by implementing a matrix of order as a key...
In this study, we present a numerical scheme to solve the telegraph equation by using Fibonacci poly...
Recently, some multiplicative groups of complex integers, i.e, Gaussian integers, were constructed t...
Since Shannon's ground-breaking work in 1948, there have been two main development streams of channe...
We propose an improved coding method of quantum key distribution protocols based on a recently propo...
Burrows-Wheeler algorithm (BWA for short) is a lossless data compression scheme, named after authors...
Abstract. Data compression has been widely applied in many data pro-cessing areas. Compression metho...
AbstractFibonacci coding is based on Fibonacci numbers and was defined by Apostolico and Fraenkel (1...
The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two c...
Recent publications advocate the use of various variable length codes for which each codeword consis...
Recent publications advocate the use of various variable length codes for which each codeword consis...
Given the need to improve the efficiency of data transfer, there are requirements to ensure their re...
Given the need to improve the efficiency of data transfer, there are requirements to ensure their re...
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robust...
We implement a decision procedure for answering questions about a class of infinite words that might...
Hill Cipher algorithm is a technique of message encoding by implementing a matrix of order as a key...
In this study, we present a numerical scheme to solve the telegraph equation by using Fibonacci poly...
Recently, some multiplicative groups of complex integers, i.e, Gaussian integers, were constructed t...
Since Shannon's ground-breaking work in 1948, there have been two main development streams of channe...
We propose an improved coding method of quantum key distribution protocols based on a recently propo...
Burrows-Wheeler algorithm (BWA for short) is a lossless data compression scheme, named after authors...