Results 1  10
of
26
Multiset and Set Decipherable Codes
, 2001
"... Abstract: We extend some results of Lempel and Restivo on multiset decipherable codes to set decipherable codes. Keywords: Codes, Unique decipherability, Multiset decipherability, Dominoes, Set decipherability. Article: 1. INTRODUCTION In unique decipherable (UD) codes, different sequences of code ..."
Abstract
 Add to MetaCart
Abstract: We extend some results of Lempel and Restivo on multiset decipherable codes to set decipherable codes. Keywords: Codes, Unique decipherability, Multiset decipherability, Dominoes, Set decipherability. Article: 1. INTRODUCTION In unique decipherable (UD) codes, different sequences of code
On McMillan’s theorem about uniquely decipherable codes
, 2008
"... Karush’s proof of McMillan’s theorem is recast as an argument involving polynomials with noncommuting indeterminates certain evaluations of which yield the Kraft sums of codes, proving a strengthened version of McMillan’s theorem. Let len: A ∗ − → N be the length function on the free monoid of all ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
strings over a given nonempty finite set A. Let con: A∗ ∗ − → A ∗ be the concatenation map which to every string of strings associates their concatenation. A uniquely decipherable code is a finite set C ⊆ A ∗ such that con is injective on the submonoid C ∗ of A∗ ∗. This submonoid is then isomorphic
Unsupervised Analysis for Decipherment Problems
"... We study a number of natural language decipherment problems using unsupervised learning. These include letter substitution ciphers, character code conversion, phonetic decipherment, and wordbased ciphers with relevance to machine translation. Straightforward unsupervised learning techniques most of ..."
Abstract

Cited by 20 (10 self)
 Add to MetaCart
We study a number of natural language decipherment problems using unsupervised learning. These include letter substitution ciphers, character code conversion, phonetic decipherment, and wordbased ciphers with relevance to machine translation. Straightforward unsupervised learning techniques most
Cryptographic imagination: Indus script and the project of scientific decipherment
"... The success of the cryptographic technique during World War II in decoding enemy ciphers holds an enduring impact on archaeologists working on decoding ancient scripts. The conviction to break open any code, in theory, employing scientific methods, mathematical formulae and computers, gives rise to ..."
Abstract
 Add to MetaCart
The success of the cryptographic technique during World War II in decoding enemy ciphers holds an enduring impact on archaeologists working on decoding ancient scripts. The conviction to break open any code, in theory, employing scientific methods, mathematical formulae and computers, gives rise
Unique Decipherability in the Monoid of Languages: an Application of Rational Relations
, 2008
"... We attack the problem of deciding whether a finite collection of finite languages is a code, that is, possesses the unique decipherability property in the monoid of finite languages. We investigate a few subcases where the theory of rational relations can be employed to solve the problem. The case ..."
Abstract
 Add to MetaCart
We attack the problem of deciding whether a finite collection of finite languages is a code, that is, possesses the unique decipherability property in the monoid of finite languages. We investigate a few subcases where the theory of rational relations can be employed to solve the problem
Codes and Formulation of Appropriate Constraints via Entropy Measures
"... Abstract—In present communication, we have developed the suitable constraints for the given the mean codeword length and the measures of entropy. This development has proved that Renyi’s entropy gives the minimum value of the log of the harmonic mean and the log of power mean. We have also developed ..."
Abstract
 Add to MetaCart
developed an important relation between best 1:1 code and the uniquely decipherable code by using different measures of entropy. Keywords—Codeword, Instantaneous code, Prefix code, Uniquely decipherable code, Best oneone code, Mean codeword length I.
SYLLABUS MAT407 Information Theory and Coding 3L1T 4
"... Information Self information, Shannon’s Entropy, joint and conditional entropies, mutual information and their properties. Discrete Memory less channels: Classification of channels, calculation of channel capacity. Source Coding, and Channels Coding. Unique decipherable Codes, condition of ..."
Abstract
 Add to MetaCart
Information Self information, Shannon’s Entropy, joint and conditional entropies, mutual information and their properties. Discrete Memory less channels: Classification of channels, calculation of channel capacity. Source Coding, and Channels Coding. Unique decipherable Codes, condition of
MAT645 Information Theory and Coding 4 Credits (3L+1T+0P)
"... Information Self information, Shannon’s Entropy, joint and conditional entropies, mutual information and their properties. Discrete Memory less channels: Classification of channels, calculation of channel capacity. Source Coding, and Channels Coding. Unique decipherable Codes, condition of Instanta ..."
Abstract
 Add to MetaCart
Information Self information, Shannon’s Entropy, joint and conditional entropies, mutual information and their properties. Discrete Memory less channels: Classification of channels, calculation of channel capacity. Source Coding, and Channels Coding. Unique decipherable Codes, condition
Generalizing the KraftMcMillan Inequality to Restricted Languages (Extended Abstract)
"... Let `1, `2,..., `n be a (possibly infinite) sequence of nonnegative integers and \Sigma some Dary alphabet. The KraftInequality states that `1, `2,..., `n are the lengths of the words in some prefix (free) code over \Sigma if and only if nX i=1 D`i < = 1. (1) Furthermore, the code is exhausti ..."
Abstract
 Add to MetaCart
is exhaustive if and only if equality holds. The McMillan Inequality states that if `1, `2,..., `n are the lengths of the words in some uniquely decipherable code, then the same condition holds. In this note we examine how the KraftMcMillan Inequality conditions for the existence of a prefix or uniquely
On the Cost of WorstCase Coding Length Constraints
 IEEE Trans. Information Theory
, 2000
"... It is shown that for any uniquely decipherable code, with a small cost in the expected coding length we can add constraints on the worstcase coding length. Moreover, this cost is related to the Fibonacci numbers. Keywords: data compression, Fibonacci numbers, Hu#man codes, source coding, uniquely d ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is shown that for any uniquely decipherable code, with a small cost in the expected coding length we can add constraints on the worstcase coding length. Moreover, this cost is related to the Fibonacci numbers. Keywords: data compression, Fibonacci numbers, Hu#man codes, source coding, uniquely
Results 1  10
of
26