Sciweavers

2018 search results - page 86 / 404
» Code Normal Forms
Sort
View
ICASSP
2010
IEEE
15 years 2 months ago
Maximizing the lifetime of clusters with Slepian-Wolf coding
In this paper, we propose an iteration-free algorithm to find the optimal configuration, including transmit power and source coding rates, to maximize the lifetime of a cluster ...
Tianqi Wang, Wendi Rabiner Heinzelman, Alireza Sey...
CORR
2010
Springer
103views Education» more  CORR 2010»
14 years 11 months ago
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
Andrew R. Barron, Antony Joseph
129
Voted
ICC
2008
IEEE
140views Communications» more  ICC 2008»
15 years 8 months ago
Numerical Performance Evaluation of impaired OFDM Links using Alamouti Space Time Coding
—In this paper we present an analytical approach to evaluate the M-QAM bit error rate (BER) as well as channel capacity of Alamouti space time coded OFDM systems in case of direc...
Marco Krondorf, Gerhard Fettweis
FSTTCS
2005
Springer
15 years 7 months ago
Non-disclosure for Distributed Mobile Code
Abstract. This paper addresses the issue of confidentiality and declassification for global computing in a language-based security perspective. The purpose is to deal with new fo...
Ana Almeida Matos
AAECC
1997
Springer
99views Algorithms» more  AAECC 1997»
15 years 6 months ago
Extension Theorems for Linear Codes over Finite Rings
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
Jay A. Wood