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 - Dan Boneh, Glenn Durfee:
Cryptanalysis of RSA with private key d less than N0.292. 1339-1349 - Ueli M. Maurer:
Authentication theory and hypothesis testing. 1350-1356 - John A. Gubner, Wei-Bin Chang, Majeed M. Hayat:
Performance analysis of hypothesis testing for sparse pairwise interaction point processes. 1357-1365 - Vladimir P. Dragalin, Alexander G. Tartakovsky, Venugopal V. Veeravalli:
Multihypothesis sequential probability ratio tests - Part II: Accurate asymptotic expansions for the expected sample size. 1366-1383 - I. Emre Telatar, David N. C. Tse:
Capacity and mutual information of wideband multipath fading channels. 1384-1400 - Oren Somekh, Shlomo Shamai:
Shannon-theoretic approach to a Gaussian cellular multiple-access channel with fading. 1401-1425 - Kiran, David N. C. Tse:
Effective interference and effective bandwidth of linear multiuser receivers in asynchronous CDMA systems. 1426-1447 - Seong Ill Park, So Ryoung Park, Iickho Song, Naoki Suehiro:
Multiple-access interference reduction for QS-CDMA systems with a novel class of polyphase sequences. 1448-1458 - Lei Wei, Honghui Qi:
Near-optimal limited-search detection on ISI/CDMA channels and decoding of long convolutional codes. 1459-1482 - Giulio Colavolpe, Riccardo Raheli:
Theoretical analysis and performance limits of noncoherent sequence detection of coded PSK. 1483-1494 - Aleksandar Kavcic, José M. F. Moura:
Matrices with banded inverses: Inversion algorithms and factorization of Gauss-Markov processes. 1495-1509
- Rolf Johannesson, Per Ståhl, Emma Wittenmark:
A note on type II convolutional codes. 1510-1514 - Yaron Shany, Yair Be'ery:
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes. 1514-1523 - Yaron Shany, Yair Be'ery:
Bounds on the state complexity of codes from the Hermitian function field and its subfields. 1523-1527 - Chaoping Xing, San Ling:
A class of linear codes with good parameters from algebraic curves. 1527-1532 - Patrick Solé:
Towers of function fields and iterated means. 1532-1535 - Hao Chen:
On the minimum distances of Schubert codes. 1535-1538 - Iliya Bouyukliev, David B. Jaffe, Vesselin Vavrek:
The smallest length of eight-dimensional binary linear codes with prescribed minimum distance. 1539-1544 - Juriaan Simonis:
Adding a parity-check bit. 1544-1545 - Kathy J. Horadam, Parampalli Udaya:
Cocyclic Hadamard codes. 1545-1550 - Noboru Hamada, Tor Helleseth, Halvard Martinsen, Øyvind Ytrehus:
There is no ternary [28, 6, 16] code. 1550-1554 - Irfan Siap, Nuh Aydin, Dwijendra K. Ray-Chaudhuri:
New ternary quasi-cyclic codes with better minimum distances. 1554-1558 - Arkadii G. D'yachkov, David C. Torney:
On similarity codes. 1558-1564 - Rasmus Refslund Nielsen:
A class of Sudan-decodable codes. 1564-1572 - Xiao Ma, Xinmei Wang:
On the minimal interpolation problem and decoding RS codes. 1573-1580 - Michael Schmidt, Gerhard P. Fettweis:
On memory redundancy in the BCJR algorithm for nonrecursive shift register processes. 1580-1584 - Catherine Lamy, Joseph Boutros:
On random rotations diversity and minimum MSE decoding of lattices. 1584-1589 - Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding. 1590-1597 - Fang-Wei Fu, Torleiv Kløve, Shu-Tao Xia:
The undetected error probability threshold of m-out-of-n codes. 1597-1599 - Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Constructing efficient DC-free runlength-limited block codes for recording channels. 1599-1602 - Flemming Topsøe:
Some inequalities for information divergence and related measures of discrimination. 1602-1609 - Uri Erez, Ram Zamir:
Noise prediction for channels with side information at the transmitter. 1610-1617 - Tamás Linder:
On the training distortion of vector quantizers. 1617-1623 - Vivek K. Goyal, Jun Zhuang, Martin Vetterli:
Transform coding with backward adaptive updates. 1623-1633 - Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú:
Universal coding of nonstationary sources. 1633-1637 - Sze-Lok Chan, Mordecai J. Golin:
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes. 1637-1644 - Samuel L. Braunstein, Christopher A. Fuchs, Daniel Gottesman, Hoi-Kwong Lo:
A quantum analog of huffman coding. 1644-1649 - Maurizio Magarini, Arnaldo Spalvieri:
Optimization of distributed detection systems under the minimum average misclassification risk criterion. 1649-1653 - Steven Kay:
Sufficiency, classification, and the class-specific feature theorem. 1654-1658 - Ulf Grenander, Anuj Srivastava, Michael I. Miller:
Asymptotic performance analysis of Bayesian target recognition. 1658-1665 - Jean-Jacques Fuchs, Bernard Delyon:
Minimal L1-norm reconstruction function for oversampled signals: Applications to time-delay estimation. 1666-1673 - Roland Averkamp, Christian Houdré:
A note on the discrete wavelet transform of second-order processes. 1673-1676 - Jesús Navarro-Moreno, Juan Carlos Ruiz-Molina, Mariano J. Valderrama:
A solution to linear estimation problems using approximate Karhunen-Loéve expansions. 1677-1682 - Tommy Guess, Mahesh K. Varanasi:
Error exponents for maximum-likelihood and successive decoders for the Gaussian CDMA channel. 1683-1691 - Shinya Matsufuji, Kyoki Imamura:
A spread-spectrum communication system protecting information data from interception. 1691-1695 - Cédric Villani:
A short proof of the "Concavity of entropy power". 1695-1696
Volume 46, Number 5, August 2000
- Donald L. Snyder, Alfred O. Hero III, Pierre Moulin, José M. F. Moura, Joseph A. O'Sullivan:
Introduction to the special issue on information-theoretic imaging. 1709-1713
- Peter C. Doerschuk, John E. Johnson:
Ab initio reconstruction and experimental design for cryo electron microscopy. 1714-1729 - Amir Leshem, Alle-Jan van der Veen:
Radio-astronomical imaging in the presence of strong radio interference. 1730-1747 - George A. Tsihrintzis, Anthony J. Devaney:
Higher order (nonlinear) diffraction tomography: Inversion of the Rytov series. 1748-1761 - Pierre Moulin, Juan Liu:
Statistical imaging and complexity regularization. 1762-1777 - Mark Hansen, Bin Yu:
Wavelet thresholding via MDL for natural images. 1778-1788 - Wee Sun Lee:
Tiling and adaptive image compression. 1789-1799 - Stéphane Chrétien, Alfred O. Hero III:
Kullback proximal algorithims for maximum-likelihood estimation. 1800-1810 - Robert D. Nowak, Eric D. Kolaczyk:
A statistical multiscale framework for Poisson inverse problems. 1811-1825 - Jia Li, Robert M. Gray, Richard A. Olshen:
Multiresolution image classification by hierarchical modeling with two-dimensional hidden Markov models. 1826-1841 - Hung-Chih Chiang, Randolph L. Moses, Lee C. Potter:
Model-based classification of radar images. 1842-1854 - Susan M. Schweizer, José M. F. Moura:
Hyperspectral imagery: Clutter adaptation in anomaly detection. 1855-1871 - Victor Solo:
Limits to estimation to stochastic ill-conditioned inverse problems. 1872-1880 - Jong Chul Ye, Yoram Bresler, Pierre Moulin:
Asymptotic global confidence regions in parametric shape estimation problems. 1881-1895 - H. L. Cooper, Michael I. Miller:
Information measures for object recognition accommodating signature variability. 1896-1907 - Haim H. Permuter, Joseph M. Francos:
Estimating the orientation of planar surfaces: Algorithims and bounds. 1908-1920
- Eli Shusterman, Michael I. Miller, Bixio Rimoldi:
Rate-distortion theory applied to automatic object recognition. 1921-1927 - Chein-I Chang:
An information-theoretic approach to spectral variability, similarity, and discrimination for hyperspectral image analysis. 1927-1932 - Robert S. Caprari:
Generalized matched filters and univariate Neyman-Pearson detectors for image target detection. 1932-1937
Volume 46, Number 6, September 2000
- Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
A new upper bound on the reliability function of the Gaussian channel. 1945-1961 - Bertrand M. Hochwald, Thomas L. Marzetta, Thomas J. Richardson, Wim Sweldens, Rüdiger L. Urbanke:
Systematic design of unitary space-time constellations. 1962-1973 - Kenneth G. Paterson, Vahid Tarokh:
On the existence and construction of good codes with low peak-to-average power ratios. 1974-1987 - Oscar Y. Takeshita, Daniel J. Costello Jr.:
New deterministic interleaver designs for turbo codes. 1988-2006 - Giuseppe Caire, Emilio Leonardi, Emanuele Viterbo:
Modulation and coding for the Gaussian collision channel. 2007-2026 - Bernard H. Fleury:
First- and second-order characterization of direction dispersion and space selectivity in the radio channel. 2027-2044 - Tommy Guess, Mahesh K. Varanasi:
Signal design for bandwidth-efficient multiple-access communications based on Eigenvalue optimization. 2045-2058 - Jamie S. Evans, David N. C. Tse:
Large system performance of linear multiuser receivers in multipath fading channels. 2059-2078 - Rong Chen, Xiaodong Wang, Jun S. Liu:
Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering. 2079-2094 - Igor V. Nikiforov:
A suboptimal quadratic change detection scheme. 2095-2107 - Te Sun Han:
Theorems on the variable-length intrinsic randomness. 2108-2116 - Te Sun Han:
The reliability functions of the general source with fixed-length coding. 2117-2132 - András Méhes, Kenneth Zeger:
Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vladut-Zink bounds. 2133-2151 - Peng Ding, Jennifer D. Key:
Minimum-weight codewords as generators of generalized Reed-Muller codes. 2152-2158 - Frances Griffin, Igor E. Shparlinski:
On the linear complexity profile of the power generator. 2159-2162 - Augustus J. E. M. Janssen, Marc J. M. de Jong:
Analysis of contention tree algorithms. 2163-2172 - Raman Venkataramani, Yoram Bresler:
Perfect reconstruction formulas and bounds on aliasing error in sub-nyquist nonuniform sampling of multiband signals. 2173-2183
- Chaoping Xing, San Ling:
A class of linear codes with good parameters. 2184-2188 - Marina Biberstein, Tuvi Etzion:
Optimal codes for single-error correction, double-adjacent-error detection. 2188-2193 - Kalle Ranto:
On algebraic decoding of the Z4-linear Goethals-like codes. 2193-2197 - Luo Yuan, Fang-Wei Fu, Victor K.-W. Wei:
On the depth distribution of linear codes. 2197-2203 - Guozhen Xiao, Shimin Wei, Kwok-Yan Lam, Kyoki Imamura:
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q). 2203-2206 - Miodrag J. Mihaljevic, Jovan Dj. Golic:
A method for convergence analysis of iterative probabilistic decoding. 2206-2211 - Marco Breiling, Lajos Hanzo:
The super-trellis structure of turbo codes. 2212-2228 - Jeng Yune Park:
The weight hierarchies of some product codes. 2228-2235 - Massimiliano Sala, Aldo Tamponi:
A linear programming estimate of the weight distribution of BCH(255, k). 2235-2237 - Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú:
Separation of random number generation and resolvability. 2237-2241 - Neri Merhav:
Universal detection of messages via finite-state channels. 2242-2246 - Christian Schlegel, Alex J. Grant:
Polynomial complexity optimal detection of certain multiple-access systems. 2246-2248 - Norman C. Beaulieu:
Bounds on variances of recovery times of decision feedback equalizers. 2249-2256 - Alexander S. Holevo:
Reliability function of general classical-Quantum channel. 2256-2261 - Tatiana Alieva, André Barbé:
Macroscopic 1/f behavior of fractal signals generated by additive substitution. 2261-2268
Volume 46, Number 7, November 2000
- John T. Coffey, Matthew Klimesh:
Fundamental limits for information retrieval. 2281-2298 - Fang-Wei Fu, Raymond W. Yeung:
On the capacity and error-correcting codes of write-efficient memories. 2299-2314 - Anand Ganti, Amos Lapidoth, I. Emre Telatar:
Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit. 2315-2328 - Mario Blaum, Jehoshua Bruck:
Coding for tolerance and detection of skew in parallel asynchronous communications. 2329-2335 - Fred Daneshgaran, Marina Mondin:
Permutation fixed points with application to estimation of minimum distance of turbo codes. 2336-2349 - Jason Thomas Blackford, Dwijendra K. Ray-Chaudhuri:
A transform approach to permutation groups of cyclic codes over Galois rings. 2350-2358 - Michio Ozeki:
On covering radii and coset weight distributions of extremal binary self-dual codes of length 56. 2359-2372 - Erik Agrell, Alexander Vardy, Kenneth Zeger:
Upper bounds for constant-weight codes. 2373-2395 - Ryoh Fuji-Hara, Ying Miao:
Optical orthogonal codes: Their bounds and new optimal constructions. 2396-2406 - Marat V. Burnashev:
On identification capacity of infinite alphabets or continuous-time channels. 2407-2414 - Te Sun Han:
Hypothesis testing with the general source. 2415-2427 - Tomohiro Ogawa, Hiroshi Nagaoka:
Strong converse and Stein's lemma in quantum hypothesis testing. 2428-2433 - Wojciech Szpankowski:
Asymptotic average redundancy of Huffman (and other) block codes. 2434-2443 - Gil I. Shamir, Daniel J. Costello Jr.:
Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part 1: The regular case. 2444-2467 - András Méhes, Kenneth Zeger:
Performance of quantizers on noisy channels using structured families of codes. 2468-2476 - Xuguang Yang, Kannan Ramchandran:
Optimal subband filter banks for multiple description coding. 2477-2490 - Radu V. Balan, Ingrid Daubechies, Vinay A. Vaishampayan:
The analysis and design of windowed Fourier frame based multiple description source coding schemes. 2491-2536 - Jorma Rissanen:
MDL Denoising. 2537-2543 - Philip Schniter, C. Richard Johnson Jr.:
Bounds for the MSE performance of constant modulus estimators. 2544-2560 - Teng Joon Lim, Yao Ma:
The Kalman Filter as the optimal linear minimum mean-squared error multiuser CDMA detector. 2561-2566 - Brian L. Hughes:
Differential Space-Time modulation. 2567-2578 - Mathias Friese:
On the achievable information rate with peak-power-limited orthogonal frequency-division multiplexing. 2579-2587 - Omer Gurewitz, Moshe Sidi, Israel Cidon:
The ballot theorem strikes again: Packet loss process distribution. 2588-2595 - Carles Padró, Germán Sáez:
Secret sharing schemes with bipartite access structure. 2596-2604
- Daniel Augot, Lancelot Pecquet:
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes. 2605-2614 - Agnes E. Heydtmann, Jørn M. Jensen:
On the equivalence of the Berlekamp-Massey and the euclidean algorithms for decoding. 2614-2624 - Dian-Wu Yue, Guang-Zeng Feng:
Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes. 2625-2628 - Thierry P. Berger:
Goppa and related codes invariant under a prescribed permutation. 2628-2633 - Antonio Campillo, José Ignacio Farrán, Carlos Munuera:
On the parameters of algebraic-geometry codes related to Arf semigroups. 2634-2638 - Cunsheng Ding, Harald Niederreiter, Chaoping Xing:
Some new codes from algebraic curves. 2638-2642 - Rumen N. Daskalov, T. Aaron Gulliver:
New quasi-twisted quaternary linear codes. 2642-2643 - Mattias Svanström:
Constructions of ternary constant-composition codes with weight three. 2644-2647 - Hans Georg Schaathun:
The weight hierarchy of product codes. 2648-2651 - Zihuai Lin, Arne Svensson:
New rate-compatible repetition convolutional codes. 2651-2659 - Søren Forchhammer, Jørn Justesen:
Bounds on the capacity of constrained two-dimensional codes. 2659-2666 - Akiko Kato, Kenneth Zeger:
Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels. 2666-2670 - Olgica Milenkovic, Bane Vasic:
Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping. 2671-2675 - Garud Iyengar, Thomas M. Cover:
Growth optimal investment in horse race markets with costs. 2675-2683 - Lei Li, Bin Yu:
Iterated logarithmic expansions of the pathwise code lengths for exponential families. 2683-2689 - Evgueni A. Haroutunian, Ashot N. Harutyunyan, Anahit R. Ghazaryan:
On rate-reliability-distortion function for a robust descriptions system. 2690-2697 - Tamás Linder, Ram Zamir, Kenneth Zeger:
On source coding with side-information-dependent distortion measures. 2697-2704 - András György, Tamás Linder:
Optimal entropy-constrained scalar quantization of a uniform source. 2704-2711 - Hongyan Kuai, Fady Alajaji, Glen Takahara:
Tight error bounds for nonuniform signaling over AWGN channels. 2712-2718 - David N. C. Tse, Sergio Verdú:
Optimum asymptotic multiuser efficiency of randomly spread CDMA. 2718-2722 - Qinghua Li, Costas N. Georghiades:
On a geometric view of multiuser detection for synchronous DS/CDMA channels. 2723-2731 - Mamadou Mboup, Phillip A. Regalia:
A gradient search interpretation of the super-exponential algorithm. 2731-2734 - Bernard C. Picinbono:
Moments and polyspectra of the discrete-time random telegraph signal. 2735-2739 - Igor V. Nikiforov:
A simple recursive algorithm for diagnosis of abrupt changes in random signals. 2740-2746 - Eric Bax:
Validation of nearest neighbor classifiers. 2746-2752 - Po-Ning Chen:
Generalization of Gártner-Ellis Theorem. 2752-2760 - Weiwei Sun:
Lower bounds of the minimal eigenvalue of a Hermitian positive-definite matrix. 2760-2762
- Xiao Ma, Xiaoyi Zhang:
Correction to "Entropy bounds for constrained two-dimensional random fields". 2763
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-16 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
