default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 41, 1995
Volume 41, Number 1, January 1995
- John A. Gubner, Brian L. Hughes:
Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints. 3-13 - Rudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker:
Localized random and arbitrary errors in the light of arbitrarily varying channel theory. 14-25 - Imre Csiszár:
Generalized cutoff rates and Renyi's information measures. 26-34 - Imre Csiszár, Prakash Narayan:
Channel capacity for a given decoding metric. 35-43 - Sridhar Vembu, Sergio Verdú, Yossef Steinberg
:
The source-channel separation theorem revisited. 44-54 - Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth:
Construction of encoders with small decoding look-ahead for input-constrained channels. 55-76 - Sara Bitan, Tuvi Etzion:
Constructions for optimal constant weight cyclically permutable codes and difference families. 77-87 - Chris J. Mitchell:
Aperiodic and semi-periodic perfect maps. 88-95 - Guu-chang Yang, Thomas E. Fuja:
Optical orthogonal codes with unequal auto- and cross-correlation constraints. 96-106 - Thomas H. E. Ericson, Victor A. Zinoviev:
Spherical codes generated by binary partitions of symmetric pointsets. 107-129 - Aaron B. Kiely, John T. Coffey, Mark R. Bell:
Optimal information bit decoding of linear block codes. 130-140 - Ram Zamir, Meir Feder:
Rate-distortion performance in coding bandlimited sources by sampling and dithered quantization. 141-154 - Jianping Pan, Thomas R. Fischer:
Two-stage vector quantization-lattice vector quantization. 155-163 - Michael L. Honig, Kenneth Steiglitz, Venkataramanan Balakrishnan, Erik Rantapaa:
Discrete-time signal design for maximizing separation in amplitude. 164-165 - Igor V. Nikiforov:
A generalized change detection problem. 171-187 - Geoffrey C. Orsak, Bernd-Peter Paris:
On the relationship between measures of discrimination and the performance of suboptimal detectors. 188-203 - Rick S. Blum:
Quantization in multisensor random signal detection. 204-215 - Amod V. Dandawate, Georgios B. Giannakis:
Asymptotic theory of mixed time averages and k th-order cyclic-moment and cumulant statistics. 216-232 - Jenn-Sen Leu, Adrian Papamarcou:
On estimating the spectral exponent of fractional Brownian motion. 233-244 - Pascal Bondon, M. Krob:
Blind identifiability of a quadratic stochastic system. 245-254 - Franz Hlawatsch, Werner Kozek:
Second-order time-frequency synthesis of nonstationary random processes. 255-267
- Patrick Solé:
Packing radius, covering radius, and dual distance. 268-272 - N. L. Tan, Lloyd R. Welch, Robert A. Scholtz:
Correcting a specified set of likely error patterns. 272-279 - Torleiv Kløve:
Codes correcting a single insertion/deletion of a zero or a single peak-shift. 279-283 - Kees A. Schouhamer Immink:
Constructions of almost block-decodable runlength-limited codes. 284-287 - Marc J. Lipman, Julia Abrahams:
Minimum average cost testing for partially ordered components. 287-291 - Tom Head, Andreas Weber:
Deciding multiset decipherability. 291-297 - Torleiv Kløve:
Bounds on the worst case probability of undetected error. 298-300 - Gerard van der Geer, Marcel van der Vlugt:
Generalized Hamming weights of BCH(3) revisited. 300-301 - Alexander Pott, S. P. Bradley:
Existence and nonexistence of almost-perfect autocorrelation sequences. 301-304 - G. Schnabl, Martin Bossert:
Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes. 304-308 - Jitendra K. Tugnait:
On blind identifiability of multipath channels using fractional sampling and second-order cyclostationary statistics. 308-311 - Haralabos C. Papadopoulos, Gregory W. Wornell:
Maximum-likelihood estimation of a class of chaotic signals. 312-317 - Bernard Delyon:
Remarks on linear and nonlinear filtering. 317-322 - John Homer, Iven M. Y. Mareels:
Echo canceler performance analysis in four-wire loop systems with correlated AR subscriber signals. 322-328 - Lang Tong, Guanghan Xu, Babak Hassibi, Thomas Kailath:
Blind channel identification based on second-order statistics: a frequency-domain approach. 329-334 - Enzo Baccarelli, Roberto Cusani, Guido di Blasio:
Recursive filtering and smoothing for reciprocal Gaussian processes-pinned boundary case. 334-337 - L. Lorne Campbell:
Averaging entropy. 338-339 - Min-Te Chao:
Comments on 'degradation of signal-to-noise ratio due to amplitude ripple'. 340
Volume 41, Number 2, March 1995
- Zhen Zhang, Toby Berger:
Multiple description source coding with no excess marginal rate. 349-357 - Bruce E. Hajek, Timothy Weller:
Scheduling nonuniform traffic in a packet switching system with large propagation delay. 358-365 - Alexis Bonnecaze, Patrick Solé, A. Robert Calderbank:
Quaternary quadratic residue codes and unimodular lattices. 366-377 - W. Cary Huffman:
The automorphism groups of the generalized quadratic residue codes. 378-386 - Gérald E. Séguin:
The q-ary image of a qm-ary cyclic code. 387-399 - Guang Gong:
Theory and applications of q-ary interleaved sequences. 400-411 - Raymond W. Yeung:
Multilevel diversity coding with distortion. 412-422 - Andrew Klapper:
d-form sequences: families of sequences with low correlation values and large linear spans. 423-431 - Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein, Øyvind Ytrehus:
Bounds on the minimum support weights. 432-440 - Marc R. Best, Marat V. Burnashev, Yannick Lévy, Alexander Moshe Rabinovich, Peter C. Fishburn, A. Robert Calderbank, Daniel J. Costello Jr.:
On a technique to calculate the exact performance of a convolutional code. 441-447 - Oscar Moreno, Zhen Zhang, P. Vijay Kumar, Victor A. Zinoviev:
New constructions of optimal cyclically permutable constant weight codes. 448-455 - P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank:
An upper bound for Weft exponential sums over Galois tings and applications. 456-468 - Gilles Zémor, Gérard D. Cohen:
The threshold probability of a code. 469-477 - Guy Louchard, Wojciech Szpankowski:
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm. 478-488 - Elias Masry, Francesco Bullo:
Convergence analysis of the sign algorithm for adaptive filtering. 489-495 - Pravin C. Jain, Nelson M. Blachman, P. M. Chapell:
Interference suppression by biased nonlinearities. 496-507
- Paul C. Shields, Benjamin Weiss:
Universal redundancy rates for the class of B-processes do not exist. 508-512 - Rick S. Blum, Saleem A. Kassam:
Distributed cell-averaging CFAR detection in dependent sensors. 513-518 - Rick S. Blum:
Distributed detection of narrowband signals. 519-523 - Rick S. Blum, Saleem A. Kassam:
On the asymptotic relative efficiency of distributed detection schemes. 523-527 - Po-Ning Chen, Adrian Papamarcou:
Error bounds for parallel distributed detection under the Neyman-Pearson criterion. 528-533 - B. Rippin, Ehud Rippin:
Min-max signal design for detection subject to linear distortion. 533-536 - Adriaan van den Bos:
The multivariate complex normal distribution-a generalization. 537-539 - Evan M. Ma, Christopher J. Zarowski:
On lower bounds for the smallest eigenvalue of a Hermitian positive-definite matrix. 539-540 - Masoud Salehi:
Source correlation in a K-out-of-M multiple-access channel. 540-546 - Fady Alajaji:
Feedback does not increase the capacity of discrete channels with additive noise. 546-549 - Carlo Blundo, Alfredo De Santis, Antonio Giorgio Gaggia, Ugo Vaccaro:
New bounds on the information rate of secret sharing schemes. 549-554 - Sergei V. Bezzateev, Natalia A. Shekhunova:
Subclass of binary Goppa codes with minimal distance equal to the design distance. 554-555 - Alec Lafourcade, Alexander Vardy:
Asymptotically good codes have infinite trellis complexity. 555-559 - Øyvind Ytrehus:
On the trellis complexity of certain binary linear block codes. 559-560 - A. N. Trofimov, Boris D. Kudryashov:
Distance spectra and upper bounds on error probability for trellis codes. 561-572 - Tsutomu Moriuchi, Kyoki Imamura:
Balanced nonbinary sequences with good periodic correlation properties obtained from modified Kumar-Moreno sequences. 572-576 - Robert Morelos-Zaragoza, Shu Lin:
QPSK block-modulation codes for unequal error protection. 576-581 - Rumen N. Daskalov, Elena Metodieva:
The nonexistence of some five-dimensional quaternary linear codes. 581-583 - Luca Penzo, Donatella Sciuto, Cristina Silvano:
Construction techniques for systematic SEC-DED codes with single byte error detection and partial correction capability for computer memory systems. 584-591 - Uwe Dettmar, Ulrich K. Sorger:
Bounded minimum distance decoding of unit memory codes. 591-596 - Edgar N. Gilbert:
Coding with digits of unequal cost. 596-600 - Roy D. Cideciyan, Sedat Ölçer:
Codes preventing quasi-catastrophic error propagation in partial-response systems. 600-604
Volume 41, Number 3, May 1995
- David L. Donoho:
De-noising by soft-thresholding. 613-627 - Stamatis Cambanis, Christian Houdré:
On the continuous wavelet transform of second-order random processes. 628-642 - Marcelo J. Weinberger, Jorma Rissanen, Meir Feder:
A universal finite memory source. 643-652 - Frans M. J. Willems, Yuri M. Shtarkov, Tjalling J. Tjalkens:
The context-tree weighting method: basic properties. 653-664 - Tamás Linder, Gábor Lugosi, Kenneth Zeger:
Fixed-rate universal lossy source coding and rates of convergence for memoryless sources. 665-676 - Gábor Lugosi, Kenneth Zeger:
Nonparametric estimation via empirical risk minimization. 677-687 - Bülent Baygün, Alfred O. Hero III:
Optimal simultaneous detection and estimation under a false alarm constraint. 688-703 - Yunxin Li, Branka Vucetic, Yoichi Sato:
Optimum soft-output detection for channels with intersymbol interference. 704-713 - Neri Merhav, Meir Feder:
A strong version of the redundancy-capacity theorem of universal coding. 714-722 - Aaron D. Wyner, Abraham J. Wyner:
Improved redundancy of a version of the Lempel-Ziv algorithm. 723-731 - A. Robert Calderbank, Peter C. Fishburn, Alexander Moshe Rabinovich:
Covering properties of convolutional codes and associated lattices. 732-746 - Emina Soljanin, Costas N. Georghiades:
Coding for two-head recording systems. 747-755 - Oliver M. Collins:
State diagram connectivity and its effects on the decoding of shift-register-based codes. 756-761 - Steven T. Dougherty:
Shadow codes and weight enumerators. 762-768 - Israel Cidon, Inder S. Gopal, Shay Kutten:
New models and algorithms for future networks. 769-780
- Jørn M. Jensen:
Subgroup subcodes. 781-785 - Ilia Krasikov, Simon Litsyn:
On spectra of BCH codes. 786-788 - Robert Morelos-Zaragoza, Shu Lin:
On primitive BCH codes with unequal error protection capabilities. 788-790 - Alain Poli:
Constructing SCN bases in characteristic 2. 790-794 - Gregory Poltyrev, Jakov Snyders:
Linear codes for the sum mod-2 multiple-access channel with restricted access. 794-799 - Marijn van Eupen:
Four nonexistence results for ternary linear codes. 800-805 - Changshik Shim, Habong Chung:
On the second generalized Hamming weight of the dual code of a double-error-correcting binary BCH code. 805-808 - P. N. Perry:
Runlength-limited codes for single error detection in the magnetic recording channel. 809-815 - Philippe Piret:
Algebraic construction of cyclic codes over Z8 with a good Euclidean minimum distance. 815-818 - Douglas A. Leonard:
Error-locator ideals for algebraic-geometric codes. 819-824 - Patrick L. Brockett, Abraham Charnes, Kwang H. Paick:
Information-theoretic approach to unimodal density estimation. 824-829 - Ola Hössjer, Ulla Holst:
On-line density estimators with high efficiency. 829-833 - Ravi Mazumdar, Arunabha Bagchi:
On the relation between filter maps and correction factors in likelihood ratios. 833-836 - Peter F. Swaszek:
A lower bound on the error probability for signals in white Gaussian noise. 837-841 - Sun Yong Kim, Iickho Song:
On the score functions of the two-sample locally optimum rank test statistic for random signals in additive noise. 842-846 - Norman C. Beaulieu, W. W. Choy:
The autocorrelation of error propagation in a one-tap decision-feedback equalizer. 847-848 - Bernard H. Fleury:
New bounds for the variation of mean-square-continuous wide-sense-stationary processes. 849-852 - René J. van der Vleuten, Jacobus H. Weber:
Construction and evaluation of trellis-coded quantizers for memoryless sources. 853-859 - Jyrki T. Lahtonen:
Two remarks on a paper by Moreno and Kumar [binary Reed-Muller codes]. 859-861 - Norbert Schmitz:
Comment on 'Optimality of the sequential probability ratio test for nonstationary observations' by Y. Liu and S.D. Blostein. 861
- Imre Csiszár:
Review of 'Universal Compression and Retrieval' (Krichevsky, R.; 1994). IEEE Trans. Inf. Theory 41(3): 862- (1995) - Rolf Johannesson:
Review of 'Algebraic Methods for Signal Processing and Communications Coding' (Blahut, R.E.; 1991). IEEE Trans. Inf. Theory 41(3): 864- (1995)
Volume 41, Number 4, July 1995
- Dariush Dabiri, Ian F. Blake:
Fast parallel algorithms for decoding Reed-Solomon codes based on remainder polynomials. 873-885 - Sangsin Na, David L. Neuhoff:
Bennett's integral for vector quantizers. 886-900 - Diego P. de Garrido, William A. Pearlman:
Conditional entropy-constrained vector quantization: high-rate theory and design algorithms. 901-916 - Mahesh Balakrishnan, William A. Pearlman, Ligang Lu:
Variable-rate tree-structured vector quantizers. 917-930 - Timo Koski:
Statistics of the binary quantizer error in single-loop sigma-delta modulation with white Gaussian input. 931-943 - Michael L. Honig, Upamanyu Madhow, Sergio Verdú:
Blind adaptive multiuser detection. 944-960 - Naofal Al-Dhahir, John M. Cioffi:
MMSE decision-feedback equalizers: finite-length results. 961-975 - David Middleton:
Threshold detection in correlated non-Gaussian noise fields. 976-1000 - Robert Sh. Liptser, Wolfgang J. Runggaldier:
Nonlinear filters for linear models (a robust approach). 1001-1009 - Hamid Krim, Jean-Christophe Pesquet:
Multiresolution analysis of a class of nonstationary processes. 1010-1020 - Joseph E. Yukich, Maxwell B. Stinchcombe, Halbert White:
Sup-norm approximation bounds for networks through probabilistic methods. 1021-1027 - Sanjeev R. Kulkarni, S. E. Posner:
Rates of convergence of nearest neighbor estimation under arbitrary sampling. 1028-1039 - Rudolf Ahlswede, Zhen Zhang:
New directions in the theory of identification via channels. 1040-1050 - Kenjiro Yanagi:
On the capacity of the discrete-time Gaussian channel with delayed feedback. 1051-1058 - Shlomo Shamai, Israel Bar-David:
The capacity of average and peak-power-limited quadrature Gaussian channels. 1060-1071 - A. A. Alsugair, Roger S. Cheng:
Symmetric capacity and signal design for L-out-of-K symbol-synchronous CDMA Gaussian channels. 1072-1082 - Mahesh K. Varanasi:
Group detection for synchronous Gaussian code-division multiple-access channels. 1083-1096 - Feng-Wen Sun, Henk C. A. van Tilborg:
The Leech lattice, the octacode, and decoding algorithms. 1097-1106 - Ligang Ke, Michael W. Marcellin:
A new construction for n-track (d, k) codes with redundancy. 1107-1115
- Wayne H. Erxleben, Michael W. Marcellin:
Error-correcting two-dimensional modulation codes. 1116-1126 - Amer A. Hassan, Wayne E. Stark:
Decoding algorithms with input quantization and maximum error correction capability. 1126-1133 - Adrian Popplewell, John J. O'Reilly:
A simple strategy for constructing a class of DC-free error-correcting codes with minimum distance 4. 1134-1137 - Helio Waldman, Eduardo Nisenbaum:
Upper bounds and Hamming spheres under the DC constraint. 1138-1145 - Kjell Jørgen Hole:
Cosets of convolutional codes with short maximum zero-run lengths. 1145-1150 - Joseph J. Rushanan:
A coset correlation for sequences with two-valued periodic autocorrelation. 1150-1153 - Gary McGuire, A. Robert Calderbank:
Proof of a conjecture of Sarwate and Pursley regarding pairs of binary m-sequences. 1153-1155 - Thomas W. Cusick:
Properties of the x2 mod N pseudorandom number generator. 1155-1159 - Laurence B. Wolfe:
On calculating Sakrison's rate distortion function for classes of parameterized sources. 1160-1163 - C. H. Gowda, Ramanarayanan Viswanathan:
Robustness of decentralized tests with {varepsilon}-contamination prior. 1164-1169 - I. M. Arbekov:
Asymptotically optimum detection of a weak signal sequence with random time delays. 1169-1174 - J. A. Fergus Ross, Desmond P. Taylor:
Multiuser signaling in the symbol-synchronous AWGN channel. 1174-1178 - Pingzhi Z. Fan, Michael Darnell, Bahram Honary:
Superimposed codes for the multiaccess binary adder channel. 1178-1182 - T. Aaron Gulliver:
New optimal ternary linear codes. 1182-1185 - Yuval Berger, Yair Be'ery:
Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes. 1185-1191 - C. Koscielny:
Constructing a better cyclic code than cyclic Reed-Solomon code. 1191-1194 - Rüdiger L. Urbanke, Dakshi Agrawal:
A counterexample to a Voronoi region conjecture. 1195-1196 - Pascal Bondon:
Invertibility conditions of a class of moment matrices and applications. 1196-1199 - Neri Merhav:
A comment on 'A rate of convergence result for a universal D-semifaithful code'. 1200-1202
- P. N. Topiwala:
Review of 'Ten Lectures on Wavelets' (Daubechies, I.; 1992). IEEE Trans. Inf. Theory 41(4): 1203 (1995)
Volume 41, Number 5, September 1995
- Eric J. Rossin, Nagabhushana T. Sindhushayana, Chris Heegard:
Trellis group codes for the Gaussian channel. 1217-1245 - Giuseppe Caire, Ezio Biglieri:
Linear block codes over cyclic groups. 1246-1256 - Roberto Garello, Sergio Benedetto:
Multilevel construction of block and trellis group codes. 1257-1264 - Umberto Mengali, Michele Morelli:
Decomposition of M-ary CPM signals into PAM waveforms. 1265-1275 - Noga Alon, Alon Orlitsky:
Repeated communication and Ramsey graphs. 1276-1289 - Patrick Fitzpatrick:
On the key equation. 1290-1302 - Vladimir I. Levenshtein:
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. 1303-1321 - Sridhar Vembu, Sergio Verdú:
Generating random bits from an arbitrary source: fundamental limits. 1322-1332 - Shlomo Shamai, Sreenivasa A. Raghavan:
On the generalized symmetric cutoff rate for finite-state channels. 1333-1346 - Takeshi Hashimoto:
Good error-detection codes satisfying the expurgated bound. 1347-1353 - Henk D. L. Hollmann:
On the construction of bounded-delay encodable codes for constrained systems. 1354-1378 - Marc P. C. Fossorier, Shu Lin:
Soft-decision decoding of linear block codes based on ordered statistics. 1379-1396 - Jan W. M. Bergmans:
Efficiency of data-aided timing recovery techniques. 1397-1408 - Xixian Chen, Masakiyo Suzuki, Nobuhiro Miki, Nobuo Nagai:
Simultaneous estimation of echo path and channel responses using full-duplex transmitted training data sequences. 1409-1417 - Gregory W. Wornell:
Spread-signature CDMA: efficient multiuser communication in the presence of fading. 1418-1438 - Irving S. Reed, Patrick Lee, Trieu-Kien Truong:
Spectral representation of fractional Brownian motion in n dimensions and its properties. 1439-1451
- Ali S. Khayrallah:
The expansion factor of error-control codes. 1452-1457 - Ali S. Khayrallah:
On the minimum bit-error rate of linear codes. 1457-1466 - Gil Kalai, Nathan Linial:
On the distance distribution of codes. 1467-1472 - Ilia Krasikov, Simon Litsyn:
On the accuracy of the binomial approximation to the distance distribution of codes. 1472-1474 - Angela I. Barbero, Juan Tena:
Weight hierarchy of a product code. 1475-1479 - Amir K. Khandani, Peter Kabal, Eric Dubois:
Computing the weight distribution of a set of points obtained by scaling, shifting, and truncating a lattice. 1480-1482 - Claude Carlet:
Generalized partial spreads. 1482-1487 - Claude Carlet:
On Z4-duality. 1487-1494 - Alexander Vardy:
Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice. 1495-1499 - Uwe Dettmar, Yan Gao, Ulrich K. Sorger:
Modified generalized concatenated codes and their application to the construction and decoding of LUEP codes. 1499-1503 - G. H. Khachatrian, S. S. Martirossian:
A new approach to the design of codes for synchronous-CDMA systems. 1503-1506 - Jyrki T. Lahtonen:
On the odd and the aperiodic correlation properties of the Kasami sequences. 1506-1508 - Steven W. McLaughlin, Jian Luo, Qun Xie:
On the capacity of M-ary runlength-limited codes. 1508-1511 - Josep Rifà:
Groups of complex integers used as QAM signals. 1512-1517 - F. Agus, Sergio Benedetto, Roberto Garello:
New 16-PSK group trellis codes. 1517-1523 - Nader Moayeri:
Some issues related to fixed-rate pruned tree-structured vector quantizers. 1523-1531 - Chi-Chao Chao, Mao-Ching Chiu, Christian Schlegel:
Comments on 'A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes'. 1531-1535 - Alexis Bonnecaze, A. Robert Calderbank, Patrick Solé:
Correction to 'Quanternary Quadratic Residue Codes and Unimodular Lattices'. IEEE Trans. Inf. Theory 41(5): 1536 (1995)
Volume 41, Number 6, November 1995
- Gilles Lachaud, Michael A. Tsfasman, Jørn Justesen, Victor K.-W. Wei:
Introduction to the special issue on algebraic geometry codes. 1545-1547
- A. G. Garcia, Henning Stichtenoth:
Algebraic function fields over finite fields with many rational places. 1548-1563 - Michael A. Tsfasman, Serge G. Vladut:
Geometric approach to higher weights. 1564-1588 - Tom Høholdt, Ruud Pellikaan:
On the decoding of algebraic-geometric codes. 1589-1614 - Gaétan Haché, Dominique Le Brigand:
Effective construction of algebraic geometry codes. 1615-1628 - Chaoping Xing:
On Automorphism Groups of the Hermitian Codes. 1629-1635 - Jean-Pierre Cherdieu:
Exponential sums, codes, and Hermitian forms. 1636-1642 - Oscar Moreno, Dmitrii V. Zinoviev, Victor A. Zinoviev:
On several new projective curves over F2 of genus 3, 4, and 5. 1643-1648 - A. H. Ali, J. W. P. Hirschfeld, Hitoshi Kaneta:
On the size of arcs in projective spaces. 1649-1656 - Ilya Dumer:
Nonbinary double-error-correcting codes designed by means of algebraic varieties. 1657-1666 - A. V. Iampolskaia, Alexei N. Skorobogatov, E. A. Sorokin:
Formula for the number of [9, 3] MDS codes. 1667-1671 - Shojiro Sakata, Jørn Justesen, Y. Madelung, Helge Elbrønd Jensen, Tom Høholdt:
Fast decoding of algebraic-geometric codes up to the designed minimum distance. 1672-1677 - Gui Liang Feng, Thammavarapu R. N. Rao:
Improved geometric Goppa codes. I. Basic theory. 1678-1693 - Ba-Zhong Shen, Kenneth K. Tzeng:
Decoding geometric Goppa codes up to designed minimum distance by solving a key equation in a ring. 1694-1702 - Ba-Zhong Shen, Kenneth K. Tzeng:
Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes. 1703-1708 - Mark E. O'Sullivan:
Decoding of codes defined by a single point on a curve. 1709-1719 - C. Kirfel, Ruud Pellikaan:
The minimum distance of codes in an array coming from telescopic semigroups. 1720-1732 - Keith Saints, Chris Heegard:
Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases. 1733-1751 - Chris Heegard, J. Little, Keith Saints:
Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes. 1752-1761 - Shojiro Sakata, Helge Elbrønd Jensen, Tom Høholdt:
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound. 1762-1772 - Marat V. Burnashev, H. Vincent Poor:
Asymptotic expansions and rate of convergence in signal detection. 1773-1787 - D. W. J. Stein:
Detection of random signals in Gaussian mixture noise. 1788-1801 - Te Sun Han, Shun-ichi Amari:
Parameter estimation with multiterminal data compression. 1802-1833 - Piero Barone, Anna Gigli, Mauro Piccioni:
Optimal importance sampling for some quadratic forms of ARMA processes. 1834-1844 - Ronald E. Helmick, W. D. Blair, S. A. Hoffman:
Fixed-interval smoothing for Markovian switching systems. 1845-1855 - Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.:
Weighted coverings and packings. 1856-1867 - Enzo Baccarelli, Roberto Cusani:
Linear feedback communication systems with Markov sources: optimal system design and performance evaluation. 1868-1876 - Mark S. Pinsker, Vyacheslav V. Prelov, Sergio Verdú:
Sensitivity of channel capacity. 1877-1888 - Vladimir B. Balakirsky:
A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels. 1889-1902 - Faouzi Kossentini, Mark J. T. Smith, Christopher F. Barnes:
Necessary conditions for the optimality of variable-rate residual vector quantizers. 1903-1914 - Charles H. Bennett, Gilles Brassard, Claude Crépeau, Ueli M. Maurer:
Generalized privacy amplification. 1915-1923 - Frank R. Kschischang, Vladislav Sorokine:
On the trellis structure of block codes. 1924-1937 - Alec Lafourcade, Alexander Vardy:
Lower bounds on trellis complexity of block codes. 1938-1954 - Khaled A. S. Abdel-Ghaffar, Mario Blaum, Jacobus H. Weber:
Analysis of coding schemes for modulation and error control. 1955-1968 - Ba-Zhong Shen, Kenneth K. Tzeng:
A code decomposition approach for decoding cyclic and algebraic-geometric codes. 1969-1987
- Fumio Kanaya, Te Sun Han:
The asymptotics of posterior entropy and error probability for Bayesian estimation. 1988-1992 - Harold Vincent Poor, Sergio Verdú:
A lower bound on the probability of error in multihypothesis testing. 1992-1994 - Venugopal V. Veeravalli, Carl W. Baum:
Asymptotic efficiency of a sequential multihypothesis test. 1994-1997 - Peter Willett, Peter F. Swaszek:
On the performance degradation from one-bit quantized detection. 1997-2003 - Sangun Park:
The Entropy of Consecutive Order Statistics. 2003-2007 - Hirosi Sugiyama, Akira Huzii:
On the distribution function of a random power series with Bernoulli variables as coefficients. 2007-2008 - William D. O'Neill:
Profit maximizing and price distortion minimizing codes for a channel model of an asset market. 2009-2014 - Hirosuke Yamamoto, Tadaaki Itoh:
Competitive optimality of source codes. 2015-2019 - Ludo M. G. M. Tolhuizen, Kees A. Schouhamer Immink, Henk D. L. Hollmann:
Constructions and properties of block codes for partial-response channels. 2019-2026 - Amir K. Khandani, Peter Kabal:
An efficient block-based addressing scheme for the nearly optimum shaping of multidimensional signal spaces. 2026-2031 - Steven W. McLaughlin, David L. Neuhoff, Jonathan J. Ashley:
Optimal binary index assignments for a class of equiprobable scalar and vector quantizers. 2031-2037 - Servanne Couturier, Daniel J. Costello Jr., Fu-Quan Wang:
Sequential decoding with trellis shaping. 2037-2040 - Tor Helleseth, P. Vijay Kumar:
The algebraic decoding of the Z4-linear Goethals code. 2040-2048 - Marijn van Eupen:
Some new results for ternary linear codes of dimension 5 and 6. 2048-2051 - A. A. Zain, B. Sundar Rajan:
Algebraic characterization of MDS group codes over cyclic groups. 2052-2056 - Thomas R. Fischer, Jianping Pan:
Enumeration encoding and decoding algorithms for pyramid cubic lattice and trellis codes. 2056-2061 - Chung-Chin Lu, Sy-Hann Huang:
On bit-level trellis complexity of Reed-Muller codes. 2061-2064 - Peter F. Swaszek, P. DiCicco:
More on the error recovery for variable-length codes. 2064-2071 - Alexander A. Davydov:
Constructions and families of covering codes and saturated sets of points in projective geometry. 2071-2080 - Nelson M. Blachman:
Random exploration of the three regular polytopes. 2081-2087 - Wojciech Szpankowski:
On asymptotics of certain sums arising in coding theory. 2087-2090 - Subrata Rakshit, Charles H. Anderson:
Error correction with frames: the Burt-Laplacian pyramid. 2091-2093 - Ajay Divakaran, William A. Pearlman:
Information-theoretic performance of quadrature mirror filters. 2094-2100
- Joy A. Thomas:
Review of 'Managing Gigabytes: Compressing and Indexing Documents and Images' (Witten, I.H., et al.; 1994). 2101
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-12-04 20:04 CET 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:
