By Topic

2006 IEEE Information Theory Workshop - ITW '06 Chengdu

Date 22-26 Oct. 2006

Filter Results

Displaying Results 1 - 25 of 167
  • [Front cover]

    Publication Year: 2006, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (570 KB)
    Freely Available from IEEE
  • Technical program

    Publication Year: 2006, Page(s):nil1 - nil17
    Request permission for commercial reuse | PDF file iconPDF (12775 KB)
    Freely Available from IEEE
  • Appendix 1: Map of China

    Publication Year: 2006, Page(s): nil18
    Request permission for commercial reuse | PDF file iconPDF (474 KB)
    Freely Available from IEEE
  • Appendix 2: Map of Chengdu City

    Publication Year: 2006, Page(s): nil19
    Request permission for commercial reuse | PDF file iconPDF (670 KB)
    Freely Available from IEEE
  • Appendix 3: The Layout of the 8th Floor of California Garden Hotel

    Publication Year: 2006, Page(s): nil20
    Request permission for commercial reuse | PDF file iconPDF (700 KB)
    Freely Available from IEEE
  • [Title page]

    Publication Year: 2006, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (1216 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 2006, Page(s): nil21
    Request permission for commercial reuse | PDF file iconPDF (16 KB)
    Freely Available from IEEE
  • PDF Not Yet Available In IEEE Xplore

    Publication Year: 2006, Page(s): nil22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    The document that should appear here is not currently available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDF Not Yet Available In IEEE Xplore

    Publication Year: 2006, Page(s): nil23
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    The document that should appear here is not currently available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDF Not Yet Available In IEEE Xplore

    Publication Year: 2006, Page(s): nil24
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    The document that should appear here is not currently available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDF Not Yet Available In IEEE Xplore

    Publication Year: 2006, Page(s): nil25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    The document that should appear here is not currently available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDF Not Yet Available In IEEE Xplore

    Publication Year: 2006, Page(s): nil26
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    The document that should appear here is not currently available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDF Not Yet Available In IEEE Xplore

    Publication Year: 2006, Page(s): nil27
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    The document that should appear here is not currently available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDF Not Yet Available In IEEE Xplore

    Publication Year: 2006, Page(s): nil28
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    The document that should appear here is not currently available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PDF Not Yet Available In IEEE Xplore

    Publication Year: 2006, Page(s): nil29
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB) | HTML iconHTML

    The document that should appear here is not currently available. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Grassmannian Packing Based on the Nordstrom-Robinson Code

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

    We construct new families of Grassmannian packings associated with the binary Nordstrom-Robinson code. The constituent subspaces are associated with projection operators which which arise in the theory of quantum stabilizer codes. These Grassmannian packings find application as highly structured of dictionaries that admit fast algorithms for identifying sparse representations, and in noncoherent w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Introduction to Tensor Product Codes and Applications to Digital Storage Systems

    Publication Year: 2006, Page(s):6 - 10
    Cited by:  Papers (5)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5137 KB) | HTML iconHTML

    Tensor product (TP) codes result from combining two constituent error control codes in a particular manner. Depending upon the types of constituent codes used, the resulting codes can be error detection codes, error correction codes, error location codes, or some combination thereof. In this paper a review of these codes will be given and possible applications to digital storage systems will be di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing self-dual codes using an automorphism group

    Publication Year: 2006, Page(s):11 - 15
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (173 KB) | HTML iconHTML

    In the talk we describe known methods for investigation binary self-dual codes using automorphisms. Some new theoretical results concerning a decomposition of a binary self-dual code having an automorphism of a composite order will be presented as well as some examples to illustrate the methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dissections and Constant Weight Codes

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

    The problem of encoding and decoding binary block codes of length n and constant Hamming weight w is formulated as a polytope dissection problem. This is done by working with a w-dimensional Euclidean space representation for the information and code vectors. Novel algorithms based on two new dissections are presented. The first is a dissection of a subset of the codebook, and has time-complexity ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Type II code over F2 + uF2 + u2F2

    Publication Year: 2006, Page(s):21 - 23
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2992 KB) | HTML iconHTML

    Motivated by the work of Dougherty, Ling and Betsumiya, we define type II codes over R = F2 + uF2 + u2F 2 as self-dual codes with Lee weights a multiple of 4. A new Gray map between codes over R and codes over F2 is defined. The existence of self-dual code over R is examined. Properties of the Gray map which take self-dual codes over R to self... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Decoding Failure Probabilities for Linear Block Codes on the Binary Erasure Channel

    Publication Year: 2006, Page(s):24 - 28
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    It has been claimed that the performance of a linear block code under iterative decoding on the binary erasure channel is determined by the stopping distance, i.e., the size of the smallest non-empty stopping set in the associated Tanner graph. Indeed, this is true from the perspective of code word retrieval. However, we show that with respect to the retrieval of just the information bits within t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence between the BCH Bound and the Schaub Bound for Cyclic Codes

    Publication Year: 2006, Page(s):29 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (175 KB) | HTML iconHTML

    The Schaub bound is one of well-known lower bounds of the minimum distance for given cyclic code C, and defined as the minimum value, which is a lower bound on rank of matrix corresponding a codeword, in defining the set for all cyclic sub-codes of a given code C. In this paper, we show equivalence between the Schaub* bound defined by F. Ponchio and M. Sala, and the BCH bound for a cyclic code C. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Syndrome-coding for the wiretap channel revisited

    Publication Year: 2006, Page(s):33 - 36
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB) | HTML iconHTML

    To communicate an r-bit secret s through a wire-tap channel, the syndrome coding strategy consists of choosing a linear transformation h and transmitting an n-bit vector x such that h(x) = s. The receiver obtains a corrupted version of x and the eavesdropper an even more corrupted version of x: the (syndrome) function h should be chosen in such a way as to minimize both the length n of the transmi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Upper and a Lower Bound on the Probability of an Undetected Error for Binary Expansions of Generalized Reed-Solomon Codes

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

    By utilizing certain characteristic structure of the Hamming weight distribution of maximum distance separable codes, we can get weight enumerators to compute an upper and a lower bound on the probability of an undetected error for binary expansions of generalized Reed-Solomon (GRS) codes. Also, values of the average probability of an undetected error are computed by using the average binary weigh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Efficient Codewords Counting Algorithm and the Weight Distributions of the Binary Quadratic Double-Circulant Codes

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

    An efficient algorithm to count all codewords of given weight and a method to deduce the modular congruence of the weight distributions of the binary quadratic double-circulant codes are presented. Using this algorithm, we give the weight distribution of the quadratic double-circulant code of length 168 and that of the extended quadratic-residue code of the same length. The weight distributions of... View full abstract»

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