• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,689
Next 10 →

Raptor codes

by Amin Shokrollahi - IEEE Transactions on Information Theory , 2006
"... LT-Codes are a new class of codes introduced in [1] for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LT-Codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes: ..."
Abstract - Cited by 577 (7 self) - Add to MetaCart
LT-Codes are a new class of codes introduced in [1] for the purpose of scalable and fault-tolerant distribution of data over computer networks. In this paper we introduce Raptor Codes, an extension of LT-Codes with linear time encoding and decoding. We will exhibit a class of universal Raptor codes

The minimum description length principle in coding and modeling

by Andrew Barron, Jorma Rissanen, Bin Yu - IEEE TRANS. INFORM. THEORY , 1998
"... We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized ..."
Abstract - Cited by 394 (18 self) - Add to MetaCart
We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the solution to optimum universal coding problems extending Shannon’s basic source coding theorem. The normalized maximized

Space-time codes for high data rate wireless communication: Performance criterion and code construction

by Vahid Tarokh, Nambi Seshadri, A. R. Calderbank - IEEE TRANS. INFORM. THEORY , 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract - Cited by 1782 (28 self) - Add to MetaCart
We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit

Iterative (turbo) soft interference cancellation and decoding for coded CDMA

by Xiaodong Wang, H. Vincent Poor - IEEE Trans. Commun , 1999
"... Abstract — The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath code-division multiple-access (CDMA) channels. In this paper, an iterative receiver structure is proposed for decoding multiuse ..."
Abstract - Cited by 456 (18 self) - Add to MetaCart
computational complexity. A low-complexity SISO multiuser detector is developed based on a novel nonlinear interference suppression technique, which makes use of both soft interference cancellation and instantaneous linear minimum mean-square error filtering. The properties of such a nonlinear interference

On optimal linear codes over F5

by Tatsuya Maruta, Maori Shinohara, Ayako Kikui
"... Let nq(k, d) be the smallest integer n for which there exists a linear code of length n, dimension k and minimum distance d over Fq, the field of q elements. ..."
Abstract - Add to MetaCart
Let nq(k, d) be the smallest integer n for which there exists a linear code of length n, dimension k and minimum distance d over Fq, the field of q elements.

Predicting fault incidence using software change history

by Todd L. Graves, Alan F. Karr, J. S. Marron, Harvey Siy - IEEE Transactions on Software Engineering , 2000
"... AbstractÐThis paper is an attempt to understand the processes by which software ages. We define code to be aged or decayed if its structure makes it unnecessarily difficult to understand or change and we measure the extent of decay by counting the number of faults in code in a period of time. Using ..."
Abstract - Cited by 262 (2 self) - Add to MetaCart
in predicting fault rates than product metrics of the code: For instance, the number of times code has been changed is a better indication of how many faults it will contain than is its length. We also compare the fault rates of code of various ages, finding that if a module is, on the average, a year older

On Randomized Network Coding

by Tracey Ho, Muriel Medard, Jun Shi, Michelle Effros, David R. Karger - In Proceedings of 41st Annual Allerton Conference on Communication, Control, and Computing , 2003
"... We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delay-free netwo ..."
Abstract - Cited by 200 (35 self) - Add to MetaCart
We consider a randomized network coding approach for multicasting from several sources over a network, in which nodes independently and randomly select linear mappings from inputs onto output links over some field. This approach was first described in [3], which gave, for acyclic delay

Hardness of Approximating the Minimum Distance of a Linear Code

by Ilya Dumer , Daniele Micciancio , Madhu Sudan , 2003
"... We show that the minimum distance d of a linear code is not approximable to within anyconstant factor in random polynomial time (RP), unless NP (nondeterministic polynomial time) equals RP. We also show that the minimum distance is not approximable to within an additiveerror that is linear in the b ..."
Abstract - Cited by 56 (6 self) - Add to MetaCart
in the block length n of the code. Under the stronger assumption that NPis not contained in RQP (random quasi-polynomial time), we show that the minimum distance is not approximable to within the factor 2log 1-ffl(n), for any ffl> 0. Our results hold for codes over any finite field, including binary codes

The Z_4-linearity of Kerdock, Preparata, Goethals, and related codes

by A. Roger Hammons, Jr., P. Vijay Kumar, A. R. Calderbank, N. J. A. Sloane, Patrick Solé , 2001
"... Certain notorious nonlinear binary codes contain more codewords than any known linear code. These include the codes constructed by Nordstrom-Robinson, Kerdock, Preparata, Goethals, and Delsarte-Goethals. It is shown here that all these codes can be very simply constructed as binary images under the ..."
Abstract - Cited by 178 (15 self) - Add to MetaCart
the Gray map of linear codes over ¡ 4, the integers mod 4 (although this requires a slight modification of the Preparata and Goethals codes). The construction implies that all these binary codes are distance invariant. Duality in the ¡ 4 domain implies that the binary images have dual weight distributions

Optimal Designs for Space-Time Linear Precoders and Decoders

by Anna Scaglione, Petre Stoica, Sergio Barbarossa, Georgios B. Giannakis, Hemanth Sampath - IEEE Trans. Signal Processing , 2001
"... In this paper we introduce a new paradigm for the design of transmitter space-time coding that we refer to as linear precoding. It leads to simple closed form solutions for transmission over frequency selective multiple-input multiple-output (MIMO) channels, which are scalable with respect to the nu ..."
Abstract - Cited by 197 (6 self) - Add to MetaCart
In this paper we introduce a new paradigm for the design of transmitter space-time coding that we refer to as linear precoding. It leads to simple closed form solutions for transmission over frequency selective multiple-input multiple-output (MIMO) channels, which are scalable with respect
Next 10 →
Results 1 - 10 of 1,689
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University