Some New Characters on the Wire-Tap Channel of Type II

Luo, Yuan; Mitrpant, C.; Vinck, A. J. Han; Chen, Kefei

doi:10.1109/tit.2004.842763

Cited by 99 publications

(195 citation statements)

References 13 publications

Supporting

Mentioning

195

Contrasting

Order By: Relevance

“…Semantic secrecy criterion considered in [22] Strong secrecy criterion considered in [23,24] Weak secrecy criterion The remainder of this paper is organized as follows. The formal statement and the main results are given in Section 2.…”

Section: Strongermentioning

confidence: 99%

See 1 more Smart Citation

Secrecy Capacity of the Extended Wiretap Channel II with Noise

Guo

Luo

2016

Entropy

View full text Add to dashboard Cite

Abstract:The secrecy capacity of an extended communication model of wiretap channelII is determined. In this channel model, the source message is encoded into a digital sequence of length N and transmitted to the legitimate receiver through a discrete memoryless channel (DMC). There exists an eavesdropper who is able to observe arbitrary µ = Nα digital symbols from the transmitter through a second DMC, where 0 ≤ α ≤ 1 is a constant real number. A pair of an encoder and a decoder is designed to let the receiver be able to recover the source message with a vanishing decoding error probability and keep the eavesdropper ignorant of the message. This communication model includes a variety of wiretap channels as special cases. The coding scheme is based on that designed by Ozarow and Wyner for the classic wiretap channel II.

show abstract

Section: Strongermentioning

confidence: 99%

“…The proof of the coding theorem was based on Csiszár's almost independent coloring scheme. Some other work on wiretap channel II can be found in [24][25][26].…”

Section: Introductionmentioning

confidence: 99%

Secrecy Capacity of the Extended Wiretap Channel II with Noise

Guo

Luo

2016

Entropy

View full text Add to dashboard Cite

show abstract

“…Relative generalized Hamming weights (RGHWs) of two linear codes are fundamental for evaluating the security of ramp secret sharing schemes and wire-tap channels of type II [6,7,9,12]. Until few years ago only the RGHWs of MDS codes and a few other examples of codes were known [8], but recently new results were discovered for one-point algebraic geometric codes [6], q-ary Reed-Muller codes [4] and cyclic codes [13].…”

Section: Introductionmentioning

confidence: 99%

Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth’s second tower

Geil¹,

Martin²,

Martínez-Peñas³

et al. 2017

JACODESMATH

View full text Add to dashboard Cite

Asymptotically good sequences of ramp secret sharing schemes were given in [5] by using one-point algebraic geometric codes defined from asymptotically good towers of function fields. Their security is given by the relative generalized Hamming weights of the corresponding codes. In this paper we demonstrate how to obtain refined information on the RGHWs when the codimension of the codes is small. For general codimension, we give an improved estimate for the highest RGHW.2010 MSC: 94A62, 94B27, 94B65

show abstract

“…The relative generalized Hamming weights (RGHW from now on) are introduced in [12]. They are a natural generalization of the generalized Hamming weights introduced by Wei in [18].…”

Section: Introductionmentioning

confidence: 99%

Some bounds for the relative generalized Hamming weights of some evaluation codes

Sarabia

2016

Analele Universitatii "Ovidius" Constanta - Seria Matematica

View full text Add to dashboard Cite

In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree. Also we compare the relative generalized Hamming weights of the codes CX (d) and C X (d) when X is embedded in X. We use these results to obtain some lower bounds for the relative generalized Hamming weights of the codes parameterized by the edges of any connected bipartite graph with bipartition (V1, V2) and where |V1| = n1, |V2| = n2, in terms of the relative generalized Hamming weights of the codes associated to the projective tori Tn 1 −1 and Tn 2 −1.

show abstract

Some New Characters on the Wire-Tap Channel of Type II

Cited by 99 publications

References 13 publications

Secrecy Capacity of the Extended Wiretap Channel II with Noise

Secrecy Capacity of the Extended Wiretap Channel II with Noise

Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth’s second tower

Some bounds for the relative generalized Hamming weights of some evaluation codes

Contact Info

Product

Resources

About