#### Filter Results:

#### Publication Year

1979

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract—Rate-distortion theory is considered for the Shannon cipher system (SCS). The… (More)

permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. run-length codes, [4], with performance within a few percent of the ideal. Finally, in a… (More)

permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract-Using the Viterbi decoding algorithm with repeat request for convolutional… (More)

permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract-Source coding problems are treated for Shannon's cipher system with correlated… (More)

reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract—The security level of the Shannon cipher system is traditionally measured by equivocation H(Y Y Y jZ), where Y Y Y is a secret plaintext with length N and Z is its cryptogram. But, Merhav and Arikan have considered another security criterion, which is… (More)

—This correspondence is concerned with asymptotic properties on the codeword length of a fixed-to-variable length code (FV code) for a general source with a finite or countably infinite alphabet. Suppose that for each 1 is encoded to a binary codeword () of length (()). Letting denote the decoding error probability, we consider the following two criteria on… (More)

permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract-The coding theorem is proved for the secret sharing communication system (SSCS)… (More)