Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 46, 2000
Volume 46, Number 1, January 2000
- Anne Canteaut, Pascale Charpin, Hans Dobbertin:
Binary m-sequences with three-valued crosscorrelation: A proof of Welch's conjecture. 4-9
- Thomas J. Richardson:
The geometry of turbo-decoding dynamics. 9-23 - Igal Sason, Shlomo Shamai:
Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum. 24-47 - Kenichiro Tanabe
:
An Assmus-Mattson theorem for Z4-codes. 48-53 - Eric M. Rains:
Polynomial invariants of quantum codes. 54-59 - Dakshi Agrawal, Alexander Vardy:
Generalized minimum distance decoding in Euclidean space: Performance analysis. 60-83 - Takeshi Hashimoto:
Nonparametric threshold decision rule, coverings, and some consequences. 84-96 - Nadav Shulman, Meir Feder:
Improved error exponent for time-invariant and periodically time-variant convolutional codes. 97-103 - Kenneth G. Paterson:
Generalized Reed-Muller codes and power control in OFDM modulation. 104-120 - Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Optimal prefix codes for sources with two-sided geometric distributions. 121-135 - Ioannis Kontoyiannis:
Pointwise redundancy in lossy data compression and universal lossy data compression. 136-152 - Cheng-Chieh Lee, Rajiv Laroia:
Trellis-based scalar vector quantization of sources with memory. 153-170 - David N. C. Tse, Ofer Zeitouni:
Linear multiuser receivers in random environments. 171-205 - Raymond Knopp, Pierre A. Humblet:
On coding for block fading channels. 189-205 - David Starobinski, Moshe Sidi:
Stochastically bounded burstiness for communication networks. 206-212 - Joe Buhler, Mohammad Amin Shokrollahi, Volker Stemann:
Fast and precise Fourier transforms. 213-228
- Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger:
Coding of sources with two-sided geometric distributions and unknown parameters. 229-236 - Harish Viswanathan, Toby Berger:
Sequential coding of correlated sources. 236-246 - Ron M. Roth, Gitit Ruckenstein:
Efficient decoding of Reed-Solomon codes beyond half the minimum distance. 246-257 - Ilya Dumer, Rafail E. Krichevskiy:
oft-decision majority decoding of Reed-Muller codes. 258-264 - Steven T. Dougherty, Keisuke Shiromoto:
MDR codes over Zk. 265-269 - Sulaiman Al-Bassam, Sultan Al-Muhammadi:
A single asymmetric error-correcting code with 213 codewords of dimension 17. 269-271 - T. Aaron Gulliver:
Optimal double circulant self-dual codes over F4. 271-274 - Ilia Krasikov, Simon Litsyn:
An improved upper bound on the minimum distance of doubly-even self-dual codes. 274-278 - Joaquim Borges, Josep Rifà:
On the nonexistence of completely transitive codes. 279-280 - Cunsheng Ding, David R. Kohel, San Ling:
Elementary 2-group character codes. 280-284 - Arkadii G. D'yachkov, Anthony J. Macula, Vyacheslav V. Rykov:
New constructions of superimposed codes. 284-290 - Aleksandar Kavcic, José M. F. Moura:
The Viterbi algorithm and Markov noise memory. 291-301 - Ljubisa Stankovic, Vladimir Katkovnik:
Instantaneous frequency estimation using higher order L-Wigner distributions with data-driven order and window length. 302-311 - Katherine A. Seaton, Jean Armstrong:
Polynomial cancellation coding and finite differences. 311-313
- Vahid Tarokh, Hamid Jafarkhani, A. Robert Calderbank:
Correction to "Space-Time codes from orthogonal designs". 314
Volume 46, Number 2, March 2000
- Srinivas M. Aji, Robert J. McEliece:
The generalized distributive law. 325-343 - Imre Csiszár, Prakash Narayan:
Common randomness and secret key generation with a helper. 344-366 - Sivarama Venkatesan, Venkat Anantharam:
The common randomness capacity of a network of discrete memoryless channels. 367-387 - Piyush Gupta, P. R. Kumar:
The capacity of wireless networks. 388-404 - Rajesh Sundaresan, Sergio Verdú:
Robust decoding for timing channels. 405-419 - Neri Merhav:
On random coding error exponents of watermarking systems. 420-430 - Qun Xie, Andrew R. Barron:
Asymptotic minimax regret for data compression, gambling, and prediction. 431-445 - Paul M. B. Vitányi, Ming Li:
Minimum description length induction, Bayesianism, and Kolmogorov complexity. 446-464 - Vivek K. Goyal:
Transform coding with integer-to-integer transforms. 465-473 - Guang Gong, Zong-Duo Dai, Solomon W. Golomb:
Enumeration and criteria for cyclically shift-distinct GMW sequences. 474-484 - Cunsheng Ding, David R. Kohel, San Ling:
Split group codes. 485-495 - Stefka Bouyuklieva:
A method for constructing self-dual codes with an automorphism of order 2. 496-504 - Lynn Margaret Batten, Michelle Davidson, Leo Storme:
An analysis of Chen's construction of minimum-distance five codes. 505-511 - Michael E. O'Sullivan:
Decoding of Hermitian codes: The key equation and efficient error evaluation. 512-523 - A. Roger Hammons Jr., Hesham El Gamal:
On the theory of space-time codes for PSK modulation. 524-542 - Bertrand M. Hochwald, Thomas L. Marzetta:
Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading. 543-564 - Paschalis Ligdas, Nariman Farvardin:
Optimizing the transmit power for slow fading channels. 565-576 - S. Unnikrishna Pillai, Hyun Seok Oh, Dante C. Youla, Joseph R. Guerci:
Optimal transmit-Receiver design in the presence of signal-dependent interference and channel noise. 577-584 - Viswanath Annampedu, Vladimir V. Roganov, Ramanarayanan Viswanathan:
Two rank order tests for M-ary detection. 585-594 - Tze Leung Lai:
Sequential multiple hypothesis testing and efficient fault detection-isolation in stochastic systems. 595-608 - G. Robert Redinbo:
Decoding real block codes: Activity detection Wiener estimation. 609-623
- John L. Fan, Brian H. Marcus, Ron M. Roth:
Lossless sliding-block compression of constrained systems. 624-633 - Kees A. Schouhamer Immink:
DC-free codes of rate (n-1)/n, n odd. 633-634 - Olav Geil, Tom Høholdt:
Footprints or generalized Bezout's theorem. 635-641 - Johannes Maucher, Victor V. Zyablov, Martin Bossert:
On the equivalence of generalized concatenated codes and generalized error location codes. 642-649 - Ilya Dumer:
Ellipsoidal lists and maximum-likelihood decoding. 649-656 - Magnus Nilsson, Håkan Lennerstad:
An upper bound on the minimum Euclidean distance for block-coded phase-shift keying. 656-662 - Kjell Jørgen Hole:
On classes of convolutional codes that are not asymptotically catastrophic. 663-669 - Bella Bose, Sulaiman Al-Bassam:
On systematic single asymmetric error-correcting codes. 669-672 - Danyo Danev, Jonas Olsson:
On a sequence of cyclic codes with minimum distance six. 673-674 - Garry Hughes:
Constacyclic codes, cocycles and a u+v | u-v construction. 674-680 - Anchung Chang, Peter Gaal, Solomon W. Golomb, Guang Gong, Tor Helleseth, P. Vijay Kumar:
On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code. 680-687 - Mark Goresky, Andrew Klapper, Lawrence C. Washington:
Fourier transforms and the 2-adic span of periodic binary sequences. 687-691 - Changho Seo, Sangjin Lee, Yeoulouk Sung, Keunhee Han, Sangchoon Kim:
A lower bound on the linear span of an FCSR. 691-693 - Kaoru Kurosawa, Fumio Sato, Takahiro Sakata, Wataru Kishimoto:
A relationship between linear complexity and kapa-error linear complexity. 694-698 - Stéphane Boucheron, Mohammad Reza Salamatian:
About priority encoding transmission. 699-705 - Rajesh Sundaresan, Sergio Verdú:
Sequential decoding for the exponential server timing channel. 705-709 - Georges A. Darbellay, Igor Vajda:
Entropy expressions for multivariate continuous distributions. 709-712 - Te Sun Han, Osamu Uchida:
Source code with cost as a nonuniform random number generator. 712-717 - Hirosuke Yamamoto:
A new recursive universal code of the positive integers. 717-723
- Douglas A. Leonard:
Ideals, varieties, and algorithms. 724-734
Volume 46, Number 3, May 2000
- John C. Kieffer, En-Hui Yang:
Grammar-based codes: A new class of universal lossless source codes. 737-754 - En-Hui Yang, John C. Kieffer:
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models. 755-777 - Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn:
Quantum error detection I: Statement of the problem. 778-788 - Alexei E. Ashikhmin, Alexander Barg, Emanuel Knill, Simon Litsyn:
Quantum error detection II: Bounds. 789-800 - Christian Krattenthaler, Paul B. Slater:
Asymptotic redundancies for universal quantum coding. 801-819 - G. David Forney Jr., Mitchell D. Trott, Sae-Young Chung:
Sphere-bound-achieving coset codes and multilevel coset codes. 820-850 - Chia-Ning Peng, Houshou Chen, John T. Coffey, Richard G. C. Williams:
Rate gains in block-coded modulation systems with interblock memory. 851-868 - Po-Ning Chen, Tzong-Yow Lee, Yunghsiang S. Han:
Distance-spectrum formulas on the largest minimum distance of block codes. 869-885 - Chaoping Xing, Huaxiong Wang, Kwok-Yan Lam:
Constructions of authentication codes from algebraic curves over finite fields. 886-892 - Benny Chor, Amos Fiat, Moni Naor, Benny Pinkas:
Tracing traitors. 893-910 - Ari Juels, Markus Jakobsson, Elizabeth A. M. Shriver, Bruce Hillyer:
How to turn loaded dice into fair coins. 911-921 - A. Robert Calderbank, Gregory J. Pottie, Nambi Seshadri:
Cochannel interference suppression through time/space diversity. 922-932 - Muriel Médard:
The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel. 933-946 - Michael L. McCloud, Louis L. Scharf:
Interference estimation with applications to blind multiple-access communication over fading channels. 947-961 - Junshan Zhang, Edwin K. P. Chong:
CDMA systems in fading channels: Admissibility, network capacity, and power control. 962-981 - Kyeongcheol Yang, Young-Ky Kim, P. Vijay Kumar:
Quasi-orthogonal sequences for code-division multiple-access systems. 982-993 - Christophe Andrieu, Arnaud Doucet:
Simulated annealing for maximum a Posteriori parameter estimation of hidden Markov models. 994-1004 - Wenxin Jiang, Martin A. Tanner:
On the asymptotic normality of hierarchical mixtures-of-experts for generalized linear models. 1005-1013 - Sameh M. Sowelam, Ahmed H. Tewfik:
Waveform selection in radar target classification. 1014-1029
- Zsigmond Nagy, Kenneth Zeger:
Capacity bounds for the three-dimensional (0, 1) run length limited channel. 1030-1033 - Augustus J. E. M. Janssen, Kees A. Schouhamer Immink:
An entropy theorem for computing the capacity of weakly (d, k)-constrained sequences. 1034-1038 - Jonathan J. Ashley, Brian H. Marcus:
Time-varying encoders for constrained systems: An approach to limiting error propagation. 1038-1043 - Ludo M. G. M. Tolhuizen:
New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback. 1043-1046 - Marc P. C. Fossorier, Shu Lin:
Differential trellis decoding of convolutional codes. 1046-1053 - Iliya Bouyukliev, Sugi Guritman, Vesselin Vavrek:
Some bounds for the minimum length of binary linear codes of dimension nine. 1053-1056 - Moshe Ran, Jakov Snyders:
On cyclic reversible self-dual additive codes with odd length over Z22. 1056-1059 - Graham H. Norton, Ana Salagean:
On the Hamming distance of linear codes over a finite chain ring. 1060-1067 - Mario Blaum, Jehoshua Bruck:
MDS array codes for correcting a single criss-cross error. 1068-1077 - Koji Okada, Kaoru Kurosawa:
MDS secret-sharing scheme secure against cheaters. 1078-1081 - Jovan Dj. Golic:
Cryptanalysis of three mutually clock-controlled stop/go shift registers. 1081-1090 - Boris Ryabko, Elena Matchikina:
Fast and efficient construction of an unbiased random sequence. 1090-1093 - Mats Näslund, Alexander Russell:
Extraction of optimally unbiased bits from a biased source. 1093-1103 - Isaac L. Chuang, Dharmendra S. Modha:
Reversible arithmetic coding for quantum data compression. 1104-1116 - Mikihiko Nishiara, Hiroyoshi Morita:
On the AEP of word-valued sources. 1116-1120 - Hamid Jafarkhani, Nariman Farvardin:
Channel-matched hierarchical table-lookup vector quantization. 1121-1125 - Han Wu Chen, Kenjiro Yanagi:
Upper bounds on the capacity of discrete-time blockwise white Gaussian channels with feedback. 1125-1131 - Fady Alajaji, Nicholas Whalen:
The capacity-cost function of discrete additive noise channels with and without feedback. 1131-1140 - George Thomas:
Capacity of the wireless packet collision channel without feedback. 1141-1144 - Samit Basu, Yoram Bresler:
A global lower bound on parameter estimation error with periodic distortion functions. 1145-1150 - Kevin J. Quirk, Laurence B. Milstein, James R. Zeidler:
A performance bound for the LMS estimator. 1150-1158 - Lei Wei, Zheng Li, Matthew R. James, Ian R. Petersen:
A minimax robust decoding algorithm. 1158-1167 - Douglas E. Lake:
Minimum Chernoff entropy and exponential bounds for locating changes. 1168-1170 - John P. Robinson:
Genetic search for Golomb arrays. 1170-1173 - Shaoquan Jiang, Zongduo Dai, Kyoki Imamura:
Linear complexity of a sequence obtained from a periodic sequence by either substituting, inserting, or deleting kappa; symbols within one period. 1174-1177
- Daniel J. Costello Jr.:
Fundamentals of convolutional coding. 1178-1179
Volume 46, Number 4, July 2000
- Nicolas Sendrier:
Finding the permutation between equivalent linear codes: The support splitting algorithm. 1193-1203 - Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, Raymond W. Yeung:
Network information flow. 1204-1216 - Te Sun Han:
Weak variable-length source coding. 1217-1226 - John C. Kieffer, En-Hui Yang, Gregory J. Nelson, Pamela C. Cosman:
Universal lossless compression via multilevel pattern matching. 1227-1245 - Serap A. Savari:
A probabilistic approach to some asymptotics in noiseless communication. 1246-1262 - Udar Mittal, Nam Phamdo:
Duality theorems for joint source-channel coding. 1263-1275 - Benjamin Belzer:
Bounds on the a priori index crossover probabilities for trellis-based channel codes. 1276-1291 - Erik Ordentlich, Ron M. Roth:
Two-dimensional weight-constrained codes through enumeration bounds. 1292-1301 - Josh Hogan, Ron M. Roth, Gitit Ruckenstein:
Nested input-constrained codes. 1302-1316 - Howard Barnum, Emanuel Knill, Michael Nielsen:
On quantum fidelities and channel capacities. 1317-1329 - Oded Goldreich, Dana Ron, Madhu Sudan:
Chinese remaindering with errors. 1330-1338