scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Secure communication over Trellis: Graph theoretic approach

TL;DR: This paper has used a class of group codes called Kernel codes and its trellis, to show that private key cryptosystem can be used over Trellis and fundamental cut-set acts as a key to encrypt and decrypt message at sender and receiver respectively.
Abstract: Forney's representation of Trellis code received wide attention by researchers and engineers with its simplicity in representing codes and elegant nature to analyze codes with sys- tem theoretic properties, graph theoretic properties with efficient encoding and decoding procedures. In this paper, we consider the connected graph nature of trellis and propose security feature over Trellis using fundamental cut-set and fundamental circuits principle. We use the graph theoretic approach, by generating limited spanning trees of trellis, fundamental cut-sets and fundamental circuits, private key cryptosystem is defined in which fundamental cut-set acts as a key to encrypt and decrypt. We have used a class of group codes called Kernel codes and its trellis, to show that private key cryptosystem can be used over Trellis and fundamental cut-set acts as a key to encrypt and decrypt message at sender and receiver respectively.
References
More filters
Book
01 Jan 1948
TL;DR: The Mathematical Theory of Communication (MTOC) as discussed by the authors was originally published as a paper on communication theory more than fifty years ago and has since gone through four hardcover and sixteen paperback printings.
Abstract: Scientific knowledge grows at a phenomenal pace--but few books have had as lasting an impact or played as important a role in our modern world as The Mathematical Theory of Communication, published originally as a paper on communication theory more than fifty years ago. Republished in book form shortly thereafter, it has since gone through four hardcover and sixteen paperback printings. It is a revolutionary work, astounding in its foresight and contemporaneity. The University of Illinois Press is pleased and honored to issue this commemorative reprinting of a classic.

10,215 citations

Proceedings Article
01 Jan 1993

7,742 citations

Proceedings ArticleDOI
23 May 1993
TL;DR: In this article, a new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed.
Abstract: A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder is built using a parallel concatenation of two recursive systematic convolutional codes, and the associated decoder, using a feedback decoding rule, is implemented as P pipelined identical elementary decoders. >

5,963 citations

Journal ArticleDOI
TL;DR: The author was led to the study given in this paper from a consideration of large scale computing machines in which a large number of operations must be performed without a single error in the end result.
Abstract: The author was led to the study given in this paper from a consideration of large scale computing machines in which a large number of operations must be performed without a single error in the end result. This problem of “doing things right” on a large scale is not essentially new; in a telephone central office, for example, a very large number of operations are performed while the errors leading to wrong numbers are kept well under control, though they have not been completely eliminated. This has been achieved, in part, through the use of self-checking circuits. The occasional failure that escapes routine checking is still detected by the customer and will, if it persists, result in customer complaint, while if it is transient it will produce only occasional wrong numbers. At the same time the rest of the central office functions satisfactorily. In a digital computer, on the other hand, a single failure usually means the complete failure, in the sense that if it is detected no more computing can be done until the failure is located and corrected, while if it escapes detection then it invalidates all subsequent operations of the machine. Put in other words, in a telephone central office there are a number of parallel paths which are more or less independent of each other; in a digital machine there is usually a single long path which passes through the same piece of equipment many, many times before the answer is obtained.

5,408 citations


"Secure communication over Trellis: ..." refers background in this paper

  • ...Shannon’s paper on Mathematical Theory of Communication [1] and Hamming’s paper on binary error correction codes [2] sparkled interest among researchers to explore the existence of codes achieving Channel capacity....

    [...]