IEEE Transactions on Information Theory, Volume 42, 1996

Volume 42, Number 1, January 1996

• Venkat Anantharam, Sergio Verdú:
  Bits through queues. 4-18
  
• Amos Beimel, Benny Chor:
  Communication in key distribution schemes. 19-28
  
• John C. Kieffer, En-Hui Yang:
  Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity. 29-39
  
• Jorma Rissanen:
  Fisher information and stochastic complexity. 40-47
  
• Gábor Lugosi, Kenneth Zeger:
  Concept learning using complexity regularization. 48-54
  
• Rudolf Ahlswede, Ning Cai, Zhen Zhang:
  Erasure, list, and detection zero-error capacities for low noise and a relation to identification. 55-62
  
• Yossef Steinberg, Sergio Verdú:
  Simulation of random processes and rate-distortion theory. 63-86
  
• Brian L. Hughes, Tony G. Thomas:
  On error exponents for arbitrarily varying channels. 87-98
  
• Erdal Arikan:
  An inequality on guessing and its application to sequential decoding. 99-105
  
• X. Giraud, Jean-Claude Belfiore:
  Constellations matched to the Rayleigh fading channel. 106-115
  
• Mahesh K. Varanasi:
  Parallel group detection for synchronous CDMA communication over frequency-selective Rayleigh fading channels. 116-128
  
• Tat M. Lok, James S. Lehnert:
  An asymptotic analysis of DS/SSMA communication systems with random polyphase signature sequences. 129-136
  
• Naofal Al-Dhahir, John M. Cioffi:
  Block transmission over dispersive channels: transmit filter optimization and realization, and MMSE-DFE receiver performance. 137-160
  
• Emanuele Viterbo, Ezio Biglieri:
  Computing the Voronoi cell of a lattice: the diamond-cutting algorithm. 161-171
  
• Torleiv Kløve:
  The worst case probability of undetected error for linear codes on the local binomial channel. 172-179
  
• Patrick Pérez, Fabrice Heitz:
  Restriction of a Markov random field on a graph and multiresolution statistical image modeling. 180-190
  
• Andrew B. Nobel, Richard A. Olshen:
  Termination and continuity of greedy growing for tree-structured vector quantizers. 191-205
  
• Parampalli Udaya, M. U. Siddiqi:
  Optimal biphase sequences with large linear complexity derived from sequences over Z₄. 206-216
  
• A. Robert Calderbank, Gary McGuire, P. Vijay Kumar, Tor Helleseth:
  Cyclic codes over Z₄, locator polynomials, and Newton's identities. 217-226
  

• Alexander Vardy, Mario Blaum, Paul H. Siegel, Glenn T. Sincerbox:
  Conservative arrays: multidimensional modulation codes for holographic recording. 227-230
  
• Fady Alajaji, Nam Phamdo, Nariman Farvardin, Thomas E. Fuja:
  Detection of binary Markov sources over channels with additive Markov noise. 230-239
  
• En-Hui Yang, John C. Kieffer:
  Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm. 239-245
  
• Carlo Blundo, Roberto De Prisco:
  New bounds on the expected length of one-to-one codes. 246-250
  
• Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth:
  Upper bound for a hybrid sum over Galois rings with applications to aperiodic correlation of some q-ary sequences. 250-254
  
• Marcel van der Vlugt:
  A note on generalized Hamming weights of BCH(2). 254-256
  
• Andrew Klapper:
  Partial period crosscorrelations of geometric sequences. 256-260
  
• Jong-Seon No:
  Generalization of GMW sequences and No sequences. 260-262
  
• Guang Gong:
  Q-ary cascaded GMW sequences. 263-267
  
• Gustavo de Veciana, George Kesidis:
  Bandwidth allocation for multiple qualities of service using generalized processor sharing. 268-272
  
• Bin Yu:
  Lower Bounds on Expected Redundancy for Nonparametric Classes. 272-275
  
• A. Kanlis, Prakash Narayan:
  Error exponents for successive refinement by partitioning. 275-282
  
• David A. Shnidman:
  Two noncentral chi-square generalizations. 283-285
  
• A. Van den Bos:
  Price's theorem for complex variates. 286-287
  
• V. A. Segalescu, Meir Zibulski, Yehoshua Y. Zeevi:
  On the role of biorthonormality in representation of random processes. 288-290
  
• Fu-Quan Wang, Daniel J. Costello Jr.:
  New rotationally invariant four-dimensional trellis codes. 291-300
  
• L. T. Wille:
  New binary covering codes obtained by simulated annealing. 300-302
  
• Alexander V. Kuznetsov, Francis Swarts, A. J. Han Vinck, Hendrik C. Ferreira:
  On the undetected error probability of linear block codes on channels with memory. 303-309
  
• Erik Agrell:
  Voronoi regions for binary linear block codes. 310-316
  
• Po-Ning Chen:
  General formulas for the Neyman-Pearson type-II error exponent subject to fixed and exponential type-I error bounds. 316-323
  

• Yaser S. Abu-Mostafa:
  Review of 'Introduction to the Theory of Neural Computation' (Hertz, J., et al.; 1991). 324
  
• Anthony Ephremides:
  Review of 'The Collected Papers of Claude E. Shannon' (Sloane, N.J.A., and Wyner, A.D., Eds.; 1993). 324
  

• Marc P. C. Fossorier, Shu Lin: Correction to 'Soft decision decoding of linear block codes based on ordered statistics' (Sep 95 1379-1396). 328

Volume 42, Number 2, March 1996

• Aaron D. Wyner, Jacob Ziv:
  Classification with finite memory. 337-347
  
• Thomas M. Cover, Erik Ordentlich:
  Universal portfolios with side information. 348-363
  
• Bixio Rimoldi, Rüdiger L. Urbanke:
  A rate-splitting approach to the Gaussian multiple-access channel. 364-375
  
• Yu-Sun Liu, Brian L. Hughes:
  A new universal random coding bound for the multiple-access channel. 376-386
  
• Brian L. Hughes, A. Brinton Cooper III:
  Nearly optimal multiuser codes for the binary adder channel. 387-398
  
• Vladimir B. Balakirsky:
  An upper bound on the distribution of computation of a sequential decoder for multiple-access channels. 399-408
  
• Sergio Benedetto, Guido Montorsi:
  Unveiling turbo codes: some results on parallel concatenated coding schemes. 409-428
  
• Joachim Hagenauer, Elke Offer, Lutz Papke:
  Iterative decoding of binary block and convolutional codes. 429-445
  
• D. H. Lee, David L. Neuhoff:
  Asymptotic distribution of the errors in scalar and vector quantizers. 446-460
  
• David L. Neuhoff:
  On the asymptotic distribution of the errors in vector quantization. 461-468
  
• Nguyen T. Thao, Martin Vetterli:
  Lower bound on the mean-squared error in oversampled quantization of periodic signals using vector quantization analysis. 469-479
  
• Tamás Linder, Kenneth Zeger:
  On the cost of finite block length in quantizing unbounded memoryless sources. 480-487
  
• Gregory W. Wornell:
  Spread-response precoding for communication over fading channels. 488-501
  
• Joseph Boutros, Emanuele Viterbo, C. Rastello, Jean-Claude Belfiore:
  Good lattice constellations for both Rayleigh fading and Gaussian channels. 502-518
  
• Thomas Mittelholzer, Jyrki T. Lahtonen:
  Group codes generated by finite reflection groups. 519-528
  
• Mario Blaum, Jehoshua Bruck, Alexander Vardy:
  MDS array codes with independent parity symbols. 529-542
  
• Xiao-an Wang, Stephen B. Wicker:
  A soft-output decoding algorithm for concatenated systems. 543-553
  
• Ron M. Roth, Gadiel Seroussi:
  Location-correcting codes. 554-565
  
• Gregory Kabatianskii, Ben J. M. Smeets, Thomas Johansson:
  On the cardinality of systematic authentication codes via error-correcting codes. 566-578
  
• P. Vijay Kumar, Tor Helleseth, A. Robert Calderbank, A. Roger Hammons Jr.:
  Large families of quaternary sequences with low correlation. 579-592
  
• Matthew R. James, Vikram Krishnamurthy, F. Le Gland:
  Time discretization of continuous-time filters and smoothers for HMM parameter estimation. 593-605
  
• Vivek S. Borkar, Sanjoy K. Mitter:
  Stochastic processes that generate polygonal and related random fields. 606-617
  

• Paul A. Voois, Inkyu Lee, John M. Cioffi:
  The effect of decision delay in finite-length decision feedback equalization. 618-621
  
• Augustus J. E. M. Janssen:
  Some counterexamples in the theory of Weyl-Heisenberg frames. 621-623
  
• Youming Liu:
  Irregular Sampling for Spline Wavelet Subspaces. 623-627
  
• Jaehyeong Kim, Gregory J. Pottie:
  On punctured trellis-coded modulation. 627-636
  
• A. Robert Calderbank, Neil J. A. Sloane:
  The ternary Golay code, the integers mod 9, and the Coxeter-Todd lattice. 636-637
  
• Shinya Matsufuji, Naoki Suehiro:
  Complex Hadamard matrices related to Bent sequences. 637
  
• John J. Komo, William J. Reid III:
  Generation of canonical M-sequences and dual bases. 638-641
  
• Karl-Heinz Zimmermann:
  On generalizations of repeated-root cyclic codes. 641-649
  
• Jan E. M. Nilsson:
  An algebraic procedure for decoding beyond e_BCH. 649-652
  
• Katherine K. Shen, Chun Wang, Kenneth K. Tzeng, Ba-Zhong Shen:
  Generation of matrices for determining minimum distance and decoding of cyclic codes. 653-657
  
• T. Aaron Gulliver, Masaaki Harada:
  Weight enumerators of extremal singly-even [60, 30, 12] codes. 658-659
  
• Eytan Modiano, Jeffrey E. Wieselthier, Anthony Ephremides:
  A simple analysis of average queueing delay in tree networks. 660-664
  
• Vladimir B. Balakirsky:
  Hashing of databases based on indirect observations of Hamming distances. 664-671
  
• H. Schwarte:
  Approaching capacity of a continuous channel by discrete input distributions. 671-675
  

• P. Vijay Kumar:
  Review of 'Algebraic Function Fields and Codes' (Stichtenoth, H.; 1993). 676
  

Volume 42, Number 3, May 1996

• A. Lafourcade, Alexander Vardy:
  Optimal sectionalization of a trellis. 689-703
  
• Elwyn R. Berlekamp:
  Bounded distance+1 soft-decision Reed-Solomon decoding. 704-720
  
• Ralf Kötter:
  Fast generalized minimum-distance decoding of algebraic-geometry and Reed-Solomon codes. 721-737
  
• Marc P. C. Fossorier, Shu Lin:
  Computationally efficient soft-decision decoding of linear block codes based on ordered statistics. 738-750
  
• Mitchell D. Trott, Sergio Benedetto, Roberto Garello, Marina Mondin:
  Rotational invariance of trellis codes. Part I. Encoders and precoders. 751-765
  
• Sergio Benedetto, Roberto Garello, Marina Mondin, Mitchell D. Trott:
  Rotational invariance of trellis codes - Part II. Group codes and decoders. 766-778
  
• Tuvi Etzion, Kenneth G. Paterson:
  Near optimal single-track Gray codes. 779-789
  
• Luca G. Tallini, Renato M. Capocelli, Bella Bose:
  Design of some new efficient balanced codes. 790-802
  
• Zhen Zhang, Victor K.-W. Wei:
  An on-line universal lossy data compression algorithm via continuous codebook refinement - Part I: Basic results. 803-821
  
• Zhen Zhang, En-Hui Yang:
  An on-line universal lossy data compression algorithm via continuous codebook refinement - Part II. Optimality for phi-mixing source models. 822-836
  
• Yasutada Oohama:
  Universal coding for correlated sources with linked encoders. 837-847
  
• Hirosuke Yamamoto:
  Source coding theory for a triangular communication system. 848-853
  
• Ali S. Khayrallah, David L. Neuhoff:
  Coding for channels with cost constraints. 854-867
  
• Andrea J. Goldsmith, Pravin Varaiya:
  Capacity, mutual information, and coding for finite-state Markov channels. 868-886
  
• Toby Berger, Zhen Zhang, Harish Viswanathan:
  The CEO problem [multiterminal source coding]. 887-902
  
• Naofal Al-Dhahir, John M. Cioffi:
  Efficiently computed reduced-parameter input-aided MMSE equalizers for ML detection: a unified approach. 903-915
  
• Joseph M. Francos, Anand Narasimhan, John W. Woods:
  Maximum-likelihood parameter estimation of the harmonic, evanescent, and purely indeterministic components of discrete homogeneous random fields. 916-930
  
• Rick S. Blum:
  Locally optimum distributed detection of correlated random signals based on ranks. 931-942
  
• Guotong Zhou, Georgios B. Giannakis:
  Polyspectral analysis of mixed processes and coupled harmonics. 943-958
  
• I. Vaughan L. Clarkson, Jane E. Perkins, Iven M. Y. Mareels:
  Number/theoretic solutions to intercept time problems. 959-971
  

• D. W. Gillman, M. Mohtashemi, Ronald L. Rivest:
  On breaking a Huffman code. 972-976
  
• A. Kato, Te Sun Han, H. Nagaoka:
  Huffman coding with an infinite alphabet. 977-984
  
• Wai-Man Lam, Sanjeev R. Kulkarni:
  Extended synchronizing codewords for binary prefix codes. 984-987
  
• A. Robert Calderbank, Gary McGuire, Bjorn Poonen, Michael Rubinstein:
  On a conjecture of Helleseth regarding pairs of binary m-sequences. 988-990
  
• Rick S. Blum:
  Necessary conditions for optimum distributed sensor detectors under the Neyman-Pearson criterion. 990-994
  
• Boaz Porat, Benjamin Friedlander:
  Asymptotic statistical analysis of the high-order ambiguity function for parameter estimation of polynomial-phase signals. 995-1001
  
• Jai Krishna Gautam, A. Kumar, R. Saxena:
  Corrections to and comments on 'Minimum-bias windows for high-resolution spectral estimates' by Athanasios Papoulis. 1001
  
• Dan Raphaeli:
  Distribution of noncentral indefinite quadratic forms in complex normal variables. 1002-1007
  
• Nelson M. Blachman:
  The shape of low minima of the envelope of narrowband Gaussian noise. 1007-1009
  
• Feng-Wen Sun, A. J. Han Vinck:
  An algorithm for identifying rate (n-1)/n catastrophic punctured convolutional encoders. 1010-1013
  
• Vladimir B. Balakirsky:
  Estimations of the transfer functions of noncatastrophic convolutional encoders. 1014-1021
  
• Martin Bossert, Vladimir Sidorenko:
  Singleton-type bounds for blot-correcting codes. 1021-1023
  
• Françoise Levy-dit-Vehel, Simon Litsyn:
  More on the covering radius of BCH codes. 1023-1028
  
• Tor Helleseth, Torleiv Kløve:
  The weight hierarchies of some product codes. 1029-1034
  
• Xiang-dong Hou:
  On the covering radius of R(1, m) in R(3, m). 1035-1037
  
• Sylvia B. Encheva:
  On binary linear codes which satisfy the two-way chain condition. 1038-1047
  

Volume 42, Number 4, July 1996

• Rajiv Laroia:
  Coding for intersymbol interference channels-combined coding and precoding. 1053-1061
  
• John R. Barry, Edward A. Lee, David G. Messerschmitt:
  Capacity penalty due to ideal zero-forcing decision-feedback equalization. 1062-1071
  
• Robert J. McEliece:
  On the BCJR trellis for linear block codes. 1072-1092
  
• E. J. Leonardo, Lin Zhang, Branka Vucetic:
  Multidimensional M-PSK trellis codes for fading channels. 1093-1108
  
• Philip A. Chou, Michelle Effros, Robert M. Gray:
  A vector quantization approach to universal noiseless coding and quantization. 1109-1138
  
• P. Knagenhjelm, Erik Agrell:
  The Hadamard transform-a tool for index assignment. 1139-1151
  
• Ram Zamir, Meir Feder:
  On lattice quantization noise. 1152-1159
  
• S. Rao, William A. Pearlman:
  Analysis of linear prediction, coding, and spectral estimation from subbands. 1160-1178
  
• Knut C. Aas, Clifford T. Mullis:
  Minimum mean-squared error transform coding and subband coding. 1179-1192
  
• Martin Janzura, Timo Koski, Antonin Otáhal:
  Minimum entropy of error estimation for discrete random variables. 1193-1201
  
• Benjamin Friedlander, Joseph M. Francos:
  On the accuracy of estimating the parameters of a regular stationary process. 1202-1211
  

• Tor Helleseth, P. Vijay Kumar, Oscar Moreno, Abhijit G. Shanbhag:
  Improved estimates via exponential sums for the minimum distance of Z₄-linear trace codes. 1212-1216
  
• Sylvia B. Encheva, Helge Elbrønd Jensen:
  Optimal binary linear codes and Z₄-linearity. 1216-1222
  
• Philippe Gaborit:
  Mass formulas for self-dual codes over Z₄ and F_q+uF_q rings. 1222-1228
  
• Iliya Boukliev, Rumen N. Daskalov, Stoyan N. Kapralov:
  Optimal quaternary linear codes of dimension five. 1228-1235
  
• Ning Chang, Solomon W. Golomb:
  7200-phase generalized Barker sequences. 1236-1238
  
• Thomas W. Cusick, Hans Dobbertin:
  Some new three-valued crosscorrelation functions for binary m-sequences. 1238-1240
  
• Andrew Klapper:
  Large families of sequences with near-optimal correlations and large linear span. 1241-1248
  
• Mathias Friese:
  Polyphase Barker sequences up to length 36. 1248-1250
  
• Moshe Ran, Jakov Snyders:
  A cyclic [6, 3, 4] group code and the hexacode over GF(4). 1250-1253
  
• Søren Forchhammer, Jorma Rissanen:
  Partially hidden Markov models. 1253-1256
  
• Daniel Augot, Françoise Levy-dit-Vehel:
  Bounds on the minimum distance of the duals of BCH codes. 1257-1260
  
• Patric R. J. Östergård, Markku K. Kaikkonen:
  New single-error-correcting codes. 1261-1262
  
• Douglas A. Leonard:
  A generalized Forney formula for algebraic-geometric codes. 1263-1268
  
• S. R. Blackburn, William G. Chambers:
  Some remarks on an algorithm of Fitzpatrick. 1269-1271
  
• Kaiming Ho, Cyril S. K. Leung:
  On the undetected error probability of binary expansions of Reed-Solomon codes. 1271-1274
  
• Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
  On the traveling salesman problem in binary Hamming spaces. 1274-1276
  
• J. Carmelo Interlando, Reginaldo Palazzo Jr., Michele Elia:
  Group block codes over nonabelian groups are asymptotically bad. 1277-1280
  
• S. Summerfield:
  Analysis of convolutional encoders and synthesis of rate-2/n Viterbi decoders. 1280-1285
  
• Richard B. Wells:
  Application of set-membership techniques to symbol-by-symbol decoding for binary data-transmission systems. 1285-1290
  
• W. J. Ebel:
  A directed search approach for unit-memory convolutional codes. 1290-1297
  
• Amir K. Khandani:
  A hierarchical dynamic programming approach to fixed-rate, entropy-coded quantization. 1298-1303
  
• Andrew B. Nobel:
  Vanishing distortion and shrinking cells. 1303-1305
  
• Michael A. Kouritzin:
  On the convergence of linear stochastic approximation procedures. 1305-1309
  
• A. Ozturk, P. R. Chakravarthi, Donald D. Weiner:
  On determining the radar threshold for non-Gaussian processes from experimental data. 1310-1316
  
• Murat Azizoglu:
  Convexity properties in binary detection problems. 1316-1321
  

• Terrence L. Fine:
  Review of 'Fundamentals of Artificial Neural Networks' (Hassoun, M.H.; 1995). 1322
  

Volume 42, Number 5, September 1996

• Noga Alon, Alon Orlitsky:
  Source coding and graph entropies. 1329-1339
  
• Ram Zamir, Meir Feder:
  Information rates of pre/post-filtered dithered quantizers. 1340-1353
  
• Meir Feder, Neri Merhav:
  Hierarchical universal coding. 1354-1364
  
• Gary J. Sullivan:
  Efficient scalar quantization of exponential and Laplacian random variables. 1365-1374
  
• Amnon Gavish, Abraham Lempel:
  Match-length functions for data compression. 1375-1380
  
• Marc P. C. Fossorier, Shu Lin:
  First-order approximation of the ordered binary-symmetric channel. 1381-1387
  
• Shlomo Shamai, Rajiv Laroia:
  The intersymbol interference channel: lower bounds on capacity and channel precoding loss. 1388-1404
  
• Khaled A. S. Abdel-Ghaffar, Jacobus H. Weber:
  Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation. 1405-1424
  
• Miroslaw Pawlak, Ulrich Stadtmüller:
  Recovering band-limited signals under noise. 1425-1438
  
• Amos Lapidoth:
  Mismatched decoding and the multiple-access channel. 1439-1452
  
• Yoichiro Watanabe:
  The total capacity of two-user multiple-access channel with binary output. 1453-1465
  
• A. Yavuz Oruç, H. M. Huang:
  Crosspoint complexity of sparse crossbar concentrators. 1466-1471
  
• Chris J. Mitchell, Tuvi Etzion, Kenneth G. Paterson:
  A method for constructing decodable de Bruijn sequences. 1472-1478
  
• Bhaskar DasGupta, Eduardo D. Sontag:
  Sample complexity for learning recurrent perceptron mappings. 1479-1487
  
• L. Finesso, Chuang-Chun Liu, Prakash Narayan:
  The optimal error exponent for Markov order estimation. 1488-1497
  
• Y. Levy, Daniel J. Costello Jr.:
  A geometric construction procedure for geometrically uniform trellis codes. 1498-1513
  

• Frans M. J. Willems, Yuri M. Shtarkov, Tjalling J. Tjalkens:
  Context weighting for general finite-context sources. 1514-1520
  
• Amos Lapidoth:
  Nearest neighbor decoding for additive non-Gaussian noise channels. 1520-1529
  
• A. Beghi:
  On the relative entropy of discrete-time Markov processes with given end-point densities. 1529-1535
  
• Shunsuke Ihara:
  Some inequalities for channel capacities, mutual informations and mean-squared errors. 1536-1540
  
• Julia Abrahams:
  Generation of discrete distributions from biased coins. 1541-1546
  
• Bane V. Vasic:
  Capacity of channels with redundant multitrack (d, k) constraints: the k<d case. 1546-1548
  
• H. Schwarte:
  On weak convergence of probability measures, channel capacity and code error probabilities. 1549-1551
  
• Kees A. Schouhamer Immink:
  A rate 4/6 (d=1, k=11) block-decodable runlength-limited code. 1551-1553
  
• Levente Pátrovics, Kees A. Schouhamer Immink:
  Encoding of dklr-sequences using one weight set. 1553-1554
  
• Alain P. Hiltgen, Kenneth G. Paterson, M. Brandestini:
  Single-track Gray codes. 1555-1561
  
• Steven S. Pietrobon:
  On the probability of error of convolutional codes. 1562-1568
  
• Andreas Weber, Tom Head:
  The finest homophonic partition and related code concepts. 1569-1575
  
• Peter Boyvalenkov, Danyo Danev, Silvia P. Boumova:
  Upper bounds on the minimum distance of spherical codes. 1576-1581
  
• Abhijit G. Shanbhag, P. Vijay Kumar, Tor Helleseth:
  Improved binary codes and sequence families from Z₄-linear codes. 1582-1587
  
• Kyeongcheol Yang, Tor Helleseth, P. Vijay Kumar, Abhijit G. Shanbhag:
  On the weight hierarchy of Kerdock codes over Z₄. 1587-1593
  
• Vera Pless, Zhongqiang Qian:
  Cyclic codes and quadratic residue codes over Z₄. 1594-1600
  
• Mario A. de Boer:
  Codes spanned by quadratic and Hermitian forms. 1600-1604
  
• J. Ruprecht, M. Rupf:
  On the search for good aperiodic binary invertible sequences. 1604-1612
  
• Marcel van der Vlugt:
  Non-BCH triple-error-correcting codes. 1612-1614
  
• Torleiv Kløve:
  Reed-Muller codes for error detection: the good, the bad, and the ugly. 1615-1622
  
• Tsukasa Sugita, Tadao Kasami, Toru Fujiwara:
  The weight distribution of the third-order Reed-Muller code of length 512. 1622-1625
  
• Amir Said, Reginaldo Palazzo Jr.:
  New ternary and quaternary linear block codes. 1625-1628
  
• Vladimir D. Tonchev, Vassil Y. Yorgov:
  The existence of certain extremal [54, 27, 10] self-dual codes. 1628-1631
  
• Katsumi Sakakibara, Masao Kasahara:
  On the minimum distance of a q-ary image of a q^m-ary cyclic code. 1631-1635
  
• P. Agabio, Ezio Biglieri:
  Bounds on the weight hierarchy of generalized concatenated codes. 1635-1640
  
• Mahesh C. Bhandari, C. Durairajan:
  A note on bounds for q-ary covering codes. 1640-1642
  

• Alfred M. Bruckstein:
  Review of 'Two-Dimensional Imaging' (Bracewell, R.N.; 1994). 1643
  

Volume 42, Number 6, November 1996

• Joan Feigenbaum, G. David Forney Jr., Brian H. Marcus, Robert J. McEliece, Alexander Vardy: Introduction to the special issue on codes and complexity. 1649-1659

• Hans-Andrea Loeliger, Thomas Mittelholzer:
  Convolutional codes over groups. 1660-1686
  
• Aaron B. Kiely, Sam Dolinar, Robert J. McEliece, Laura Ekroot, Wei Lin:
  Trellis decoding complexity of linear block codes. 1687-1697
  
• L. C. Perez, J. Seghers, Daniel J. Costello Jr.:
  A distance spectrum interpretation of turbo codes. 1698-1709
  
• Michael Sipser, Daniel A. Spielman:
  Expander codes. 1710-1722
  
• Daniel A. Spielman:
  Linear-time encodable and decodable error-correcting codes. 1723-1731
  
• Noga Alon, Michael Luby:
  A linear time erasure-resilient code with nearly optimal recovery. 1732-1736
  
• Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan:
  Priority encoding transmission. 1737-1744
  
• Leonard J. Schulman:
  Coding for interactive communication. 1745-1756
  
• Jacques Stern:
  A new paradigm for public key identification. 1757-1768
  
• Gilles Brassard, Claude Crépeau, Miklos Santha:
  Oblivious transfers and intersecting codes. 1769-1780
  
• Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi, Madhu Sudan:
  Linearity testing in characteristic two. 1781-1795
  
• Vahid Tarokh, Ian F. Blake:
  Trellis complexity versus the coding gain of lattices I. 1796-1807
  
• Vahid Tarokh, Ian F. Blake:
  Trellis complexity versus the coding gain of lattices II. 1808-1816
  
• Yuval Berger, Yair Be'ery:
  The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes. 1817-1827
  
• Frank R. Kschischang:
  The trellis structure of maximal fixed-cost codes. 1828-1838
  
• Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan:
  An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. 1839-1854
  
• Robert J. McEliece, Wei Lin:
  The trellis complexity of convolutional codes. 1855-1864
  
• G. David Forney Jr., Rolf Johannesson, Zhe-xian Wan:
  Minimal and canonical rational generator matrices for convolutional codes. 1865-1880
  
• Joachim Rosenthal, J. M. Schumacher, Eric V. York:
  On behaviors and convolutional codes. 1881-1891
  
• Fabio Fagnani, Sandro Zampieri:
  Dynamical systems and convolutional codes over finite Abelian groups. 1892-1912
  
• Jonathan J. Ashley:
  A linear bound for sliding-block decoder window size, II. 1913-1924
  

• Jonathan J. Ashley, Razmik Karabed, Paul H. Siegel:
  Complexity and sliding-block decodability. 1925-1947
  
• Jonathan J. Ashley, Brian H. Marcus, Ron M. Roth:
  On the decoding delay of encoders for input-constrained channels. 1948-1956
  
• Henk D. L. Hollmann:
  Bounded-delay-encodable, block-decodable codes for constrained systems. 1957-1970
  
• Ilya Dumer:
  Suboptimal decoding of linear codes: partition technique. 1971-1986
  
• Ba-Zhong Shen, Kenneth K. Tzeng, Chun Wang:
  A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient. 1987-1991
  
• G. David Forney Jr., Alexander Vardy:
  Generalized minimum-distance decoding of Euclidean-space codes and lattices. 1992-2026
  
• Alexander Vardy, Frank R. Kschischang:
  Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis. 2027-2033
  
• P. Schuurman:
  A table of state complexity bounds for binary linear codes. 2034-2042
  
• G. B. Horn, Frank R. Kschischang:
  On the intractability of permuting a block code to minimize trellis complexity. 2042-2048
  
• Vladimir Sidorenko, Garik Markarian, Bahram Honary:
  Minimal trellis design for linear codes based on the Shannon product. 2048-2053
  
• Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
  On greedy algorithms in coding theory. 2053-2057
  

• Imre Csiszár, Paul C. Shields:
  Redundancy rates for renewal and other processes. 2065-2072
  
• Ram Zamir:
  The rate loss in the Wyner-Ziv problem. 2073-2084
  
• J. Stein, Jacob Ziv, Neri Merhav:
  Universal delay estimation for discrete channels. 2085-2093
  
• Evgueni A. Haroutunian:
  Multiterminal source coding achievable rates and reliability. 2094-2101
  
• Vittorio Castelli, Thomas M. Cover:
  The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter. 2102-2117
  
• Wee Sun Lee, Peter L. Bartlett, Robert C. Williamson:
  Efficient agnostic learning of neural networks with bounded fan-in. 2118-2132
  
• Dharmendra S. Modha, Elias Masry:
  Minimum complexity regression estimation with weakly dependent observations. 2133-2145
  
• Ron M. Roth:
  Tensor codes for the rank metric. 2146-2157
  
• Hiroyoshi Morita, Adriaan J. de Lind van Wijngaarden, A. J. Han Vinck:
  On the construction of maximal prefix-synchronized codes. 2158-2166
  
• Francesco Fabris, Andrea Sgarro, R. Pauletti:
  Tunstall adaptive coding and miscoding. 2167-2180
  
• P. CharnKeitKong, Hideki Imai, Kazuhiko Yamaguchi:
  On classes of rate k/(k+1) convolutional codes and their decoding techniques. 2181-2193
  
• Thierry P. Berger, Pascale Charpin:
  The permutation group of affine-invariant extended cyclic codes. 2194-2209
  

• Frans M. J. Willems:
  Coding for a binary independent piecewise-identically-distributed source. 2210-2217
  
• Jehoshua Bruck, Ching-Tien Ho:
  Fault-tolerant cube graphs and coding theory. 2217-2221
  
• T. Veugen:
  A simple class of capacity-achieving strategies for discrete memoryless channels with feedback. 2221-2228
  
• Andrew L. Rukhin, I. Vajda:
  The error probability, entropy, and equivocation when the number of input messages increases. 2228-2231
  
• Erik Ordentlich:
  On the factor-of-two bound for Gaussian multiple-access channels with feedback. 2231-2235
  
• A. J. Han Vinck, K. J. Keuning:
  On the capacity of the asynchronous T-user M-frequency noiseless multiple-access channel without intensity information. 2235-2238
  
• Yoram Bresler:
  Bounds on the aliasing error in multidimensional Shannon sampling. 2238-2241
  
• D. A. Abraham:
  A Page test with nuisance parameter estimation. 2242-2252
  
• Solomon W. Golomb, Oscar Moreno:
  On periodicity properties of Costas arrays and a conjecture on permutation polynomials. 2252-2253
  
• Jong-Seon No, Hwan-Keun Lee, Habong Chung, Hong-Yeop Song, Kyeongcheol Yang:
  Trace representation of Legendre sequences of Mersenne prime period. 2254-2255
  
• Andreas Faldum, Wolfgang Willems:
  A characterization of codes with extreme parameters. 2255-2257
  
• Torleiv Kløve:
  Bounds on the weight distribution of cosets. 2257-2260
  
• T. Aaron Gulliver:
  New optimal quaternary linear codes of dimension 5. 2260-2265
  
• Wende Chen, Torleiv Kløve:
  The weight hierarchies of q -ary codes of dimension 4. 2265-2272
  

• Bruce Hajek:
  Review of 'Discrete Stochastic Processes' (Gallager, R.G.; 1996). 2273
  

Last update Fri May 24 20:55:29 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page