Notice
There is currently an issue with the citation download feature. Learn more

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)

31 March-4 April 2003

Filter Results

Displaying Results 1 - 25 of 90
  • Optimised constructions for variable-length error correcting codes

    Publication Year: 2003, Page(s):183 - 186
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB) | HTML iconHTML

    An optimised construction of variable-length error-correcting (VLEC) codes is proposed. Compared to the state-of-the-art, the three main improvements consist in: (1) improving the codewords search algorithm complexity/efficiency trade-off; (2) loosening the codewords deletion rule; (3) taking advantage of eventual previous searches. It is shown that the optimised algorithm can find good VLEC codes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification of Boolean cubic forms of nine variables

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

    We describe a new invariant that we have used to obtain the complete classification of the cubic forms of nine variables. In particular, we compute the covering radius of the Reed-Muller code RM(2, 9) into RM(3, 9). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiple power analysis breaks the advanced version of the randomized addition-subtraction chains countermeasure against side channel attacks

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

    We show that the advanced version of the randomized addition-subtraction chains countermeasure against side channel attacks is vulnerable to a multiple power analysis attack, a new kind of side channel attack, under distinguishability between addition and doubling. The side channel attack takes advantage of information leaked during execution of a cryptographic procedure. The randomized addition-s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of mapping strategies for turbo-coded space-time block codes

    Publication Year: 2003, Page(s):103 - 106
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB) | HTML iconHTML

    We propose a "turbo" coding scheme for the multiple-input multiple-output (MIMO) Rayleigh fading channel consisting of the serial concatenation of a block code as the outer code and different orthogonal space-time block codes (STBC) for more than two transmit antennas as the inner code. Here, we consider the orthogonal STBC as a mapping scheme in space and time. At the receiver, we apply iterative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security analysis of the improved group signature

    Publication Year: 2003, Page(s):171 - 174
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    We show that the improved group signature (Yuh-Min Tseng and Jinn-ke Jan, Electron. Lett., vol.35, no.16, p.1324, 1999) has an essential flaw: universal forgery. An adversary can forge a group membership certificate to sign any message without being traced by the group manager. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On MIMO capacity for various types of partial channel knowledge at the transmitter

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

    For a transmitter that has a perfect knowledge of the MIMO channel, the maximum achievable capacity corresponds to the waterfilling solution. In practice, the available knowledge may only be partial due to the time selectivity of the channel, and the delay or absence of feedback from the receiver. However, exploiting the partial knowledge leads to a significant improvement when compared to the cap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An IND-CPA cryptosystem from Demytko's primitive

    Publication Year: 2003, Page(s):167 - 170
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    An encryption scheme should satisfy semantic security or indistinguishability of encryptions against chosen plaintext attack (IND-CPA). We propose an elliptic curve scheme over the ring Z(n2), which is efficient and semantically secure in the standard model. It is based on factoring, and it has expansion factor 2 (previous schemes with these features present expansion factors greater th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal transmission design for MIMO block fading channels with feedback capacity constraint

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

    We focus on investigating the optimal MIMO transmission strategy and the optimal feedback strategy for forward channel capacity and forward error exponent of MIMO block fading channels when the feedback link is causal and has a capacity constraint. We assume a forward MIMO block fading channel where the channel state information is estimated at the receiver and partially fed back to the transmitte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A flaw in a self-healing key distribution scheme

    Publication Year: 2003, Page(s):163 - 166
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (463 KB) | HTML iconHTML

    A self-healing key distribution scheme enables a dynamic group of users to establish a group key over an unreliable channel. In such a scheme, a group manager, to distribute a session key to each member of the group, broadcasts packets along the channel. If some packets get lost, users are still capable of recovering the group key using the received packets, without requesting additional transmiss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The spectral efficiency of linear precoders

    Publication Year: 2003, Page(s):90 - 93
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (529 KB) | HTML iconHTML

    Recent results on the asymptotic empirical eigenvalue distribution of the sum or product of matrices, based on the free probability theory, have enabled the study of the asymptotic limits of linear precoded OFDM systems with MMSE equalization for ergodic and non-ergodic channels. We extend these results to the MMSE successive interference cancellation detector with realistic channels and give an e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An authentication scheme based on roots of sparse polynomials

    Publication Year: 2003, Page(s):159 - 162
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    We describe an authentication scheme whose security is based on the hardness of finding roots of systems of sparse polynomial equations in many variables and of high degree. One of the new ideas is the use of many keys. In one authentication session, a small amount of information about only one of them, chosen randomly, is released; this may be useful in other situations as well. Although the prac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replica analysis of large-system CDMA

    Publication Year: 2003, Page(s):22 - 25
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    We present some new results on large-system CDMA obtained through the replica method developed in statistical physics. We find the spectral efficiency of randomly spread CDMA subject to Gaussian noise and flat fading in the large-system limit under arbitrary input distributions. Both joint decoding and single-user decoding are considered. In the latter case, a conditional mean estimator is first a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source-channel communication with feedback

    Publication Year: 2003, Page(s):279 - 282
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (482 KB) | HTML iconHTML

    Feedback may greatly simplify the coding techniques needed to achieve the (information-theoretically) optimum performance. This is true both for the capacity problem and for the joint source-channel coding problem. We are interested in the latter. Gaussian examples involving feedback have appeared in the literature (Cruise, T.J., 1967; Kailath, T., 1967; Schalkwijk, J.P.M. and Bluestein, L.I., 196... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributive iterative method for minimizing generalized total square correlation of CDMA systems

    Publication Year: 2003, Page(s):86 - 89
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB) | HTML iconHTML

    We define the total generalized square correlation (TGSC) for a given signature sequence set used in code division multiple access (CDMA) systems in the presence of colored noise. Total square correlation (TSC) and total weighted correlation (TWSC) are particular cases of TGSC and are considered as well. We provide an iterative and distributed method for obtaining sequences that minimize TGSC. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new identity based signcryption scheme from pairings

    Publication Year: 2003, Page(s):155 - 158
    Cited by:  Papers (73)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (518 KB) | HTML iconHTML

    We present a new identity based scheme using pairings over elliptic curves. It combines the functionalities of signature and encryption and is provably secure in the random oracle model. We compare it with J. Malone-Lee's scheme from the points of view of security and efficiency. We give a proof of semantic security under the decisional bilinear Diffie-Hellman assumption for this new scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple MAP decoding of first order Reed-Muller and Hamming codes

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

    We present new MAP decoding algorithms for first order Reed-Muller and Hamming codes. The proposed algorithms have complexities proportional to n×log2(n), where n is the code length. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The turbo principle in joint source-channel coding

    Publication Year: 2003, Page(s):275 - 278
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    The turbo principle (iterative decoding between component decoders) is a general scheme, which we apply to joint source-channel decoding. As a realistic example (e.g., speech parameter coding), we discuss joint source-channel decoding for auto-correlated continuous-amplitude source samples. At the transmitter, the source samples are quantized and their indexes are appropriately mapped onto bitvect... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial Reed Solomon codes for erasure channels

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

    We introduce a new family of linear block codes, which we refer to as partial Reed Solomon (PRS) codes. These codes are specifically designed and optimized for real-time multimedia communication over packet-based erasure channels. Based on the constraints and flexibilities of real-time applications, we define a performance measure, message throughput (τm), which is suitable for thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information hiding by coverings

    Publication Year: 2003, Page(s):151 - 154
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB) | HTML iconHTML

    We propose a formal model for embedding information in black and white images and prove the equivalence between the existence of embedding schemes and covering codes. An asymptotically tight bound on the performance of embedding schemes is given. We construct efficient embedding schemes via known coverings. In particular, one of those schemes allows the embedding of up to View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On recursive decoding with sublinear complexity for Reed-Muller codes

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

    Reed-Muller (RM) codes (m, r) of length 2m are considered on a binary symmetric (BS) channel with high crossover error probability 1/2 -ε. For an arbitrarily small ε>0, new recursive decoding algorithms are designed that retrieve all information bits of RM codes of fixed order r with a vanishing error probability and sublinear complexity of order O(mr+1). The algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for cycle and add property of m-sequence

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

    The cycle and add properties (CAP) of m-sequences are discussed. For given integers τ and η, a method which decides λ to satisfy the CAP {ak+η}+{ak+τ}={ak+λ} is proposed; the acquisition of the CAP of an m-sequence, {ak}, only depends on the reciprocal polynomial of the primitive polynomial which produces the m-sequence and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lattices which are good for (almost) everything

    Publication Year: 2003, Page(s):271 - 274
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB) | HTML iconHTML

    Using random coding techniques, we show that, in high dimensions, there exist lattices which are simultaneously good as sphere packings, sphere coverings, AWGN channel and MSE quantization codes. These lattices are produced by a construction, similar to construction A (Conway, J.H. and Sloane, N.J.A., 1988), and a randomly chosen set of generating vectors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Wheel codes: turbo-like codes on graphs of small order

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

    We investigate a specific class of codes on graphs called wheel codes, where the underlying graph of a wheel code is constructed by the wheel construction. Wheel codes were first introduced by N. Wiberg ("Codes and Decoding on General Graphs", PhD thesis, U. Linkping, Sweden, 1996). They are very similar to turbo codes except that the interleaver has more structure, which allows for a simpler impl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the algebraic thickness and non-normality of Boolean functions

    Publication Year: 2003, Page(s):147 - 150
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (510 KB) | HTML iconHTML

    Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. From the cryptographic viewpoint, the two main criteria in evaluating the complexity of Boolean functions on F2n are the nonlinearity and the algebraic degree. Two other criteria have also been considered: the algebraic thickness and the non-normality. It is known that, asymptotically... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A complexity reducing transformation in algebraic list decoding of Reed-Solomon codes

    Publication Year: 2003, Page(s):10 - 13
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (505 KB) | HTML iconHTML

    The main computational steps in algebraic soft decoding, as well as Sudan-type list decoding, of Reed-Solomon codes are interpolation and factorization. A series of transformations is given for the interpolation problem that arises in these decoding algorithms. These transformations reduce the space and time complexity to a small fraction of the complexity of the original interpolation problem. A ... View full abstract»

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