By Topic

Information Theory Workshop (ITW), 2010 IEEE

Date Aug. 30 2010-Sept. 3 2010

Filter Results

Displaying Results 1 - 25 of 107
  • [Title page]

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (269 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (17 KB)
    Freely Available from IEEE
  • Committees

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Welcome to ITW 2010

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (29 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program at a glance

    Publication Year: 2010, Page(s):1 - 9
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Applications of semidefinite programming to coding theory

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (133 KB) | HTML iconHTML

    We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Abelian varieties in coding and cryptography

    Publication Year: 2010, Page(s):1 - 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (122 KB) | HTML iconHTML

    Algebraic curves over a finite field have played a central role in both coding theory and cryptography over the past three decades. In coding theory the use of algebraic curves led to the discovery of asymptotically good codes whose parameters lie above the Varshamov-Gilbert bound in certain cases while in cryptography the use of elliptic curves led to public key cryptosystems that are more effici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local computation in codes

    Publication Year: 2010, Page(s):1 - 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB) | HTML iconHTML

    A locally testable code allows one to store vast amounts of data, where estimating the fraction of errors in the data takes roughly as much time as takes to read one bit of the data! If the fraction of errors is below a certain threshold, a locally decodeable code would allow one to recover every bit of the original message, again, in time which is roughly the time to read one bit of the data. Are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unimodular lattices for the Gaussian Wiretap Channel

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    In the authors introduced a lattice invariant called “Secrecy Gain” which measures the confusion experienced by a passive eavesdropper on the Gaussian Wiretap Channel. We study, here, the behavior of this invariant for unimodular lattices by using tools from Modular Forms and show that, for some families of unimodular lattices, indexed by the dimension, the secrecy gain exponentially... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The enumeration of Costas arrays of order 28

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (109 KB) | HTML iconHTML

    We present the results of the enumeration of Costas arrays of order 28: all arrays found are accounted for by the Golomb and Welch construction methods, making 28 the first order (larger than 5) for which no sporadic Costas arrays exist. The enumeration was performed on several computer clusters and required the equivalent of 70 years of single CPU time. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Frobenius extensions of finite rings and trace functions

    Publication Year: 2010, Page(s):1 - 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (125 KB) | HTML iconHTML

    We present a notion of generalized Frobenius extension for finite rings, and study related trace functions. Then we show applications of such extensions for algebraic coding theory. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust parent-identifying codes

    Publication Year: 2010, Page(s):1 - 4
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (122 KB) | HTML iconHTML

    Codes with the identifiable parent property (IPP codes) are used in traitor tracing schemes that protect data broadcast by the publisher from unauthorized access or distribution. An n-word y over a finite alphabet is called a descendant of a set of t words x1, ..., xt if yi ϵ {x1i, ..., xti} for all i = 1, ... n. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification codes in cryptographic protocols

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (119 KB) | HTML iconHTML

    Identification codes were introduced by Ahlswede and Dueck more than twenty years ago. There is today a lot of studies to identify objects such as contactless devices (for instance RFID tags) but, surprisingly, no one has considered the use of this kind of codes in the literature for that purpose until the recent work of Bringer et al. at Indocrypt '09. We here show how the security of these new i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent results on bent and hyper-bent functions and their link with some exponential sums

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (143 KB) | HTML iconHTML

    Bent functions are maximally nonlinear Boolean functions with an even number of variables. They were introduced by Rothaus in 1976. For their own sake as interesting combinatorial objects, but also because of their relations to coding theory (Reed-Muller codes) and applications in cryptography (design of stream ciphers), they have attracted a lot of research, specially in the last 15 years. The cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (134 KB) | HTML iconHTML

    We give a slight improvement on Xing's lower bound for frameproof codes constructed from algebraic curves. Combined with some additional number-theoretic assumptions (still conjectural) and a concatenation process, this should lead to the existence of a family of binary 2-frameproof codes of asymptotic rate going beyond the up to now best known (non-constructive) lower bound. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boolean functions whose restrictions are highly nonlinear

    Publication Year: 2010, Page(s):1 - 5
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (133 KB) | HTML iconHTML

    We construct Boolean functions whose non-trivial restrictions are either highly nonlinear with respect to the Walsh-Hadamard or the negahadamard transform. We generalise these properties, identify group actions that preserve them, and obtain complementary sets from our functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding solutions for the secure biometric storage problem

    Publication Year: 2010, Page(s):1 - 4
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (98 KB) | HTML iconHTML

    The paper studies the problem of securely storing biometric passwords, such as fingerprints and irises. With the help of coding theory Juels and Wattenberg derived in 1999 a scheme where similar input strings will be accepted as the same biometric. In the same time nothing could be learned from the stored data. They called their scheme a fuzzy commitment scheme. In this paper we will revisit the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Every channel with time structure has a capacity sequence

    Publication Year: 2010, Page(s): 1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (48 KB) | HTML iconHTML

    This paper discusses the theorem that channels with time structure has a capacity sequence. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multi-hop multi-source Algebraic Watchdog

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (334 KB) | HTML iconHTML

    In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police their downstream neighbors locally using overheard messages; thus, provide a secure global self-checking network. As the first building block of such a system, we focused on a two-hop network, and presented a graphical model to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding against myopic adversaries

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (143 KB) | HTML iconHTML

    A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literatu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved linear programming decoding and bounds on the minimum distance of LDPC codes

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (133 KB) | HTML iconHTML

    We propose a technique for improving LP decoding, based on the merging of check nodes. This technique can be applied to standard as well as generalized LDPC codes. Furthermore, we show how a recently-discovered linear-complexity LP decoder can be used to derive non-trivial lower bounds on the minimum distance of specific LDPC codes, with complexity that exhibits quadratic growth with respect to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graphical model for computing the minimum cost transposition distance

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    We address the problem of finding the minimum decomposition of a permutation in terms of transpositions with non-uniform cost. For metric-path costs, we describe exact polynomial-time decomposition algorithms. For extended-metric-path cost functions, we describe polynomial-time constant-approximation decomposition algorithms. Our algorithms rely on graphical representations of permutations and gra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coupled graphical models and their thresholds

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (502 KB) | HTML iconHTML

    The excellent performance of convolutional low-density parity-check codes is the result of the spatial coupling of individual underlying codes across a window of growing size, but much smaller than the length of the individual codes. Remarkably, the belief-propagation threshold of the coupled ensemble is boosted to the maximum-a-posteriori one of the individual system. We investigate the generalit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of graph-cover pseudocodewords of codes over F3

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (149 KB) | HTML iconHTML

    Linear-programming pseudocodewords play a pivotal role in our understanding of the linear-programming decoding algorithms. These pseudocodewords are known to be equivalent to the graph-cover pseudocodewords. The latter pseudocodewords, when viewed as points in the multidimensional Euclidean space, lie inside a fundamental cone. This fundamental cone depends on the choice of a parity-check matrix o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal source polarization and sparse recovery

    Publication Year: 2010, Page(s):1 - 5
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1638 KB) | HTML iconHTML

    Polar codes allow to perform lossless compression of i.i.d. sources at the lowest rate with low encoding and decoding complexity. In this paper, it is shown that for binary sources, there exist “universal polar codes” which can compress any source of low enough entropy, without requiring knowledge of the source distribution. While this result does not extend to q-ary sources, it is s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.