Proceedings: Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Piscataway, NJ
IEEE
1995
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXII, 506 S. Ill., graph. Darst. |
| ISBN: | 0780324536 0780324544 0780324552 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010921771 | ||
| 003 | DE-604 | ||
| 005 | 20230314 | ||
| 007 | t| | ||
| 008 | 960829s1995 xx ad|| |||| 10||| eng d | ||
| 020 | |a 0780324536 |c Softbound |9 0-7803-2453-6 | ||
| 020 | |a 0780324544 |c Casebound |9 0-7803-2454-4 | ||
| 020 | |a 0780324552 |c Microfiche |9 0-7803-2455-2 | ||
| 035 | |a (OCoLC)33427660 | ||
| 035 | |a (DE-599)BVBBV010921771 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-91 |a DE-83 |a DE-706 | ||
| 050 | 0 | |a Q350 | |
| 082 | 0 | |a 003.54 | |
| 084 | |a ZN 6015 |0 (DE-625)157492: |2 rvk | ||
| 084 | |a ELT 505f |2 stub | ||
| 111 | 2 | |a International Symposium on Information Theory (Institute of Electrical and Electronics Engineers) |d 1995 |c Whistler, British Columbia |j Verfasser |0 (DE-588)5160088-2 |4 aut | |
| 245 | 1 | 0 | |a Proceedings |b Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 |c 1995 IEEE International Symposium on Information Theory |
| 264 | 1 | |a Piscataway, NJ |b IEEE |c 1995 | |
| 300 | |a XXII, 506 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Information, Théorie de l' - Congrès |2 ram | |
| 650 | 7 | |a théorie information |2 inriac | |
| 650 | 4 | |a Information theory |v Congresses | |
| 650 | 0 | 7 | |a Datennetz |0 (DE-588)4011130-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informationstheorie |0 (DE-588)4026927-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Telekommunikationsnetz |0 (DE-588)4133586-7 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1995 |z Whistler British Columbia |2 gnd-content | |
| 689 | 0 | 0 | |a Informationstheorie |0 (DE-588)4026927-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Telekommunikationsnetz |0 (DE-588)4133586-7 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Datennetz |0 (DE-588)4011130-1 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung TU Muenchen |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007305353&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007305353 | |
Datensatz im Suchindex
| _version_ | 1820868275483967488 |
|---|---|
| adam_text |
Table
of
Contents
The Shannon Lecture
Performance and complexity—G. David Forney Jr.
1
Plenary Session Lectures
Symbolic dynamics and coding applications—Marcus, B.
2
Inequalities for source coding: Some are more equal than others—Ziv, J.
3
Quantum information theory—Brassard, G.
4
Wavelets: An overview, with recent applications—Daubechies, I.
5
Session MOAM1 Shannon Theory
Generalized projections for non-negative functions-Csiszar, I.
6
Capacity of channels with uncoded-message side-information-Shamai (Shitz), S.,
and
Verdú,
S.
7
Zero-error list capacities of discrete memoryless channels—Telatar, I.E.
8
Information efficiency in investment-Cover, T.M., and Erkip, E.
9
Sensitivity of Gaussian channel capacity and rate-distortion function to
nonGaussian contamination—Pinsker, M.S., Prelov, V.V., and Verdu, S.
10
Determining the independence of random variables—Massey, J.L.
11
Information-theoretic bounds in authentication theory
—Maurer, U.M. 12
The empirical distribution of good codes—Shamai (Shitz), S., and
Verdú,
S.
13
Session MOAM2 Universal Lossless Source Coding
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital trees—
Jacquet, P.,
and Szpankowski, W.
14
Empirical context allocation for multiple dictionary data compression—Franaszek, P.,
and Thomas, J.
15
Universal coding for arbitrarily varying sources—
Feder,
M.,
and Merhav,
N. 16
A two-stage universal coding procedure using sufficient statistics—Matsushima,
T.,
and Hirasawa, S.
17
Adaptive limitation of the dictionary size in LZW data compression-Ouaissa, K.,
Abdat, M., and Plume, P.
18
Universal coding of integers and unbounded search trees-Ahlswede, R.,
Han, T.S.,
and Kobayashi, K.
19
On the context tree maximizing algorithm—
Volf, P.AJ.,
and
Willems, F.M
J.
20
A fixed-to-variable variation of the Ziv-Lempel coding—
I wata,
К.,
Uyematsu,
T.,
and Okamoto,
E.
21
Proposal of partially decodable Ziv-Lempel code-Iwata, K., Uyematsu,
T.,
and Okamoto, E.
22
Session MOAM3 Code Division Multiple Access
Coded multicarrier code division multiple access-Rowitch, D.N., and Milstein, L.B.
23
The performance of voice and data communications in a mobile cellular CDMA
system-Gass, J.H., Jr.,
Noneaker, D.L.,
and Pursley, M.B.
24
Successive cancellation in fading multipath CDMA channels-Varanasi, M.K.
25
Adaptive interference suppression for DS-CDMA with impulsive noise—
Mandayam,
N.B. 26
Error-and-erasure decoding of convolutional coded DS/SSMA communications
in AWGN and Rayleigh fading channels-Kwon, J.M., and Kim,
S.W. 27
Diversity performance of
π/4
-DQPSK
for the reverse link in a DS-CDMA
cellular system-Miller, L.E., and Lee, J.S.
28
On the expected value of the average interference parameter of code-sequences
in CDMA systems-Schotten, H.D. 29
Synchronous frequency-hopped CDMA using wavelets-Daneshgaran,
F.,
and
Mondin, M.
30
Near-orthogonal coding for spread spectrum and error correction-Halford, K.W.,
Rozenbaum,
Y
.,
and Brandt-Pearce,
M
. 31
Session MOAM4 Turbo Codes
Unveiling turbo codes: some results on parallel concatenated codes-Benedetto, S.,
and
Montorsi,
G.
32
Unit-memory Hamming turbo codes-Cheng, J.-F., and McEliece, RJ.
33
Distance spectrum of the turbo-codes-Podemski, R., Holubowicz, W.,
Berrou,
С,
and Glavieux, A.
34
Low-rate turbo codes for deep-space communications—Divsalar, D., and
Pollara, F. 35
'Turbo' coding for deep space applications-Andersen, J.D.
36
Interleaver design for three dimensional turbo codes—Barbulescu, A.S.,
and Pietrobon,
S.S. 37
Weight distributions of turbo-codes-Svirid, Y.V.
38
Threshold decoding of turbo-codes-Svirid, Y.V., and
Riedel, S. 39
Session MOAM5 Broadband Networks and Protocols
An efficient reservation connection control protocol for gigabit networks-Varvarigos,
E.A., and Sharma, V.
40
Guaranteeing spatial coherence in real-time multicasting—Pokam, M.R., and
Michel, G.
41
Peakedness of stochastic models for high-speed network traffic-Mark, B.L.,
Jagerman,
D.L., and Ramamurthy, G.
42
Fault detection in communication protocols using signatures—Noubir, G.,
Vijayananda, K., and Raja, P.
43
Sporadic information sources-Loner, U.
44
An analysis approach for cell loss rate of shared buffer ATM switching—Zhao,
Y.-B., Yu, J.-P., and Liu, Z.-J.
45
A scheme to adopt dynamic selection of error-correcting codes in hybrid ARQ
protocol-Zhong, L., Xuemai, G., Qing, G., and Shilou, J.
46
Session MOAM6 Signal Processing and Coding
Importance sampling for TCM scheme on additive non-Gaussian noise channel-
Sakai, T.,
and Ogiwara, H.
47
BRM sequence generators based on the field GF(2n) for DSP implementations-
Lee, S.-J.,
Goh,
S.-C.,
Kim, K.-J.,
and Lee, D.-K.
48
Shift register synthesis for multiplicative inversion over GF(2m)-Hasan, M.A.
49
On me probability of undetected error and the computational complexity to detect
an error for iterated codes—Nishijima,
T.,
and Hirasawa, S.
50
Wavefront
decoding of trellis codes-Larsson, T.
51
Potential-decoding, error correction beyond the half minimum distance for
linear block
codes-Löhnert, R. 52
Information set decoding complexity for linear codes in bursty channels with side
information—Sung, W., and Coffey, J.T.
53
When is hard decision decoding enough?—Swaszek, P.F.
54
First order approximation of the ordered binary symmetric channel-
Fossorier, M.P.C., and Lin, S.
55
An asymptotic evaluation on the number of computation steps required for
the nearest point search over a binary tree-Suzuki, H., and Arimoto, S.
56
New estimation of the probability of undetected error-Blinovsky, V.
57
Some remarks on efficient inversion in finite fields-Paar, C.
58
VI
Session
МОЛМ7
Coded
Modulation
Multilevel coding with the 8-PSK signal set-Persson, J.
59
Soft-decision decoding for trellis coding and phase-difference modulation-
Pursley, M.B., and Shea, J.M.
60
Coding and decoding of punctured QAM trellis codes—Chan,
F.,
and Haccoun, D.
61
Power efficient rate design for multilevel codes with finite blocklength-Huber, J.,
and
Wachsmann,
U.
62
Trellis coding of Gaussian filtered MSK-Tyczka, P., and Holubowicz, W.
63
Bit error rate reduction of TCM systems using linear scramblers—Gray, P.K.,
and
Rasmussen,
L. K.
64
Multidimensional signaling for bandlimited channels—Daneshgaran,
F.,
and
Mondin, M. 65
Effect of encoder phase on sequential decoding of linear coded modulation—
Balachandran, K., and Anderson, J.B.
66
Reduced complexity algorithms in multistage decoding of multilevel codes—
Bobrowski, R., and Holubowicz, W.
67
A novel general approach to the optimal synthesis of trellis-codes for arbitrary
noisy discrete memoryless channels—Baccarelli, E., Cusani, R.,
and
Piazzo, L.
68
Session MOPM1 Information Theory and Applications
Identification via compressed data—Ahlswede, R., Yang, E.-H., and Zhang, Z.
69
Asymptotics of Fisher information under weak perturbation—Prelov, V.V., and
van
der Meulen, E.C. 70
A matrix form of the Brunn-Minkowski inequality— Zamir, R., and
Feder,
M.
71
The influence of the memory for a special permutation channel-Tamm, U.
72
The relation of description rate and investment growth rate—Erkip, E., and
Cover, T.M.
73
Multi-way alternating minimization-
Yeung, R.W.,
and
Berger, T.
74
Generating non-Markov random sources with high Shannon entropy—
D'yachkov, A.G., and Sidelnikov,
V.M. 75
On the equivalence of some different definitions of capacity of the multiple-access
collision channel with multiplicity feedback—
Ruszinkó,
M.
76
Matrix approach to the problem of matrix partitioning-Stasevich, S.I., and
Koshelev, V.N.
77
Using the ideas of the information theory to study communication systems of
social animals—
Řezníkova, Z.,
and Ryabko, B.Y.
78
Session MOPM2 Universal Lossy Source Coding
Fixed-slope universal algorithms for lossy source coding via lossless codeword
length functions-Yang, E.-H., Zhang, Z., and
Berger,
T.
79
A lossy data compression based on an approximate pattern matching-Luczak,
T.,
and Szpankowski, W.
80
The gold-washing algorithm (II): Optimality for
φ
-mixing
sources-Zhang, Z.,
and Yang, E.-H.
81
Universal estimation of the optimal probability distributions for data compression
of discrete memoryless sources with fidelity criterion—
Koga,
H.,
and
Arimoto, S.
82
A universal data-base for data compression-Muramatsu, J,, and Kanaya, F.
83
Universal compression algorithms based on approximate string matching—
Sadeh, I.
84
VII
Session
МОРМЗ
CDMA
Sequence Families
Certain exponential sums over Galois rings and related constructions of families of
sequences—Lahtonen,
J
. 85
Generalization of No sequences-No, J.-S.
86
Codes for optical transmission at different rates-Moreno, O., and Marie,
S.V. 87
An upper bound for extended
Kloosterman
sums over Galois rings-
Shanbhag, A.G., Kumar, P.V., and Helleseth, T.
88
Optimization of the ambiguity function of binary sequences and their mismatched
filters for use in CTDMA systems-Schotten, H.D., and
Ruprecht, J. 89
Optimal sequence sets meeting Welch's lower bound—Mow, W.H.
90
New signal design method by coded addition of sequences—Suehiro,
N. 91
An upper bound for the aperiodic correlation of weighted-degree CDMA
sequences-Shanbhag, A.G., Kumar, P.V., and Helleseth, T.
92
Construction of signal sets with constrained amplitude spectrum with upper
bounds on cross-correlation-Chandran, G., and Jaffe, J.S.
93
Session MOPM4 Algebraic Geometry Codes
On
Gröbner
bases of the error-locator ideal of Hermitian codes-Chen, X.,
Reed, I.S.,
and Helleseth, T.
94
A new approach to determine a lower bound of generalized Hamming weights
using an improved Bezout theorem-Feng, G.L., and Rao, T.R.N.
95
Fast erasure-and-error decoding of any one-point
AG
codes up to the Feng-Rao
bound-Sakata, S.
96
The
(64,32,27)
Hermitian code and its application in fading channels-Chen, X.,
and
Reed, I.S.
97
New construction of codes from algebraic curves—Shen, B.-Z., and Tzeng, K.K.
98
A fast parallel decoding algorithm for general one-point
AG
codes with a
systolic array architecture-Kurihara, M., and
Sakata, S.
99
Effective construction of self-dual geometric Goppa
codes-Haché, G.
100
On codes containing Hermitian codes-Blahut, R.E.
101
Multilevel codes based on matrix completion—Dabiri, D., and Blake, I.F.
102
Session MOPM5 Modeling Analysis and Stability in Networks
Rate distortion functions and effective bandwidth of queueing processes-
Chang, C.S., and Thomas, J.A.
103
Large bursts don't cause instability—
Hajek,
В.
104
The extension of optimaliry of threshold policies in queueing systems with two
heterogeneous constant-rate servers-Traganitis,
Α.,
and Ephremides, A.
105
Elimination of bistability in spread-spectrum multiple-access networks—
Murali,
R.,
and Hughes, B.L.
106
Transient analysis of media access protocols by diffusion approximation-
Ren, Q., and Kobayashi, H.
107
Multi-media multi-rate CDMA communications—Chang, Y.-W., Yao, S.,
and Geraniotis, E.
108
Stability analysis of quota allocation access protocols in ring networks with
spatial reuse-Georgiadis, L., Szpankowski, W., and Tassiulas, L.
109
Capacity of digital cellular CDMA system with adaptive receiver-Oppermann, I.,
Vucetic, B.S., and Rapajic, P.B.
1
Ю
Vili
Session MOPM6 Signal Processing
Quadratic-inverse spectrum estimates for non-stationary processes-Thomson,
DJ. 111
Parameter estimation and order determination in the low-rank linear statistical
model-Tufts,
D.W.,
Vaccaro, RJ., and Shah,
A.A. 112
Blind identification in non-Gaussian impulsive environments-Ma, X., and
Nikias, C.L.
113
Algorithms for blind identification of digital communication
channels-Buisán
Gómez
del Moral, J., and Biglieri, E.
114
A class of iterative signal restoration algorithms—Noonan, J.P., Natarajan, P.,
andAchour, B.
115
Stochastic processes and linear combinations of periodic clock changes-
Aakvaag, N.D., Duverdier,
Α.,
and Lacaze, B.
116
Near optimum filtering of quantized signals-
Alencar,
M.S., and Scharcanski, J.
117
Likelihood ratio partitions for distributed signal detection in correlated Gaussian
noise-Chen, P.-N., and Papamarcou, A.
118
Rational moment mapping—
Ferreira, H.C.
119
Real-time tracking of nonstationary signals using the Jacobi
SVD algorithm-
Lorenzelli,
F.,
and Yao, K.
120
Improved LMS estimation via structural detection-Homer, J.,
Mareeis,
I.,
Bitmead, R.,
Wahlberg,
В.,
and
Gustafsson,
F. 121
Session MOPM7 Trellis Structures annd Trellis Decoding
The trellis structure of maximal fixed-cost codes—Kscnischang, F.R.
122
On trellis complexity of block codes: optimal sectionalizations—
Lafourcade-Jumenbo,
Α.,
and Vardy
,
A.
123
On trellis complexity of block codes: lower bounds-Lafourcade-Jumenbo,
Α.,
and Vardy, A.
124
Trellis complexity versus the coding gain of lattices—Tarokh, V., and Blake, I.F.
125
Rotationally invariant, punctured trellis coding-Rossin, E.J., Rowe,
DJ.,
andHeegard.C.
126
Trellises with parallel structure for block codes with constraint on maximum
state space dimension—Moorthy, H.T., Lin, S., and Uehara, G.
127
Reconfigurable
trellis decoding of linear block codes-Kot,
A.D.,
and Leung,
С
128
On the twisted squaring construction, symmetric-reversible designs and trellis
diagrams of block codes—
Berger, Y.,
and Be'ery, Y.
129
Codes which satisfy the two-way chain condition and their state complexities-
Encheva, S.B.
130
The trellis complexity of convolutional codes-McEliece,
R
J., and Lin, W.
131
Session TUAM1 Channel Capacity
If binary codes existed that exceed Gilbert-Varshamov bound they could not
reach the cutoff rate of BSC-Beth, T.
,
and Lazic
, D.E. 132
A simple proof that time-invariant convolutional codes attain
capaci
ty-
Shulman, N., and
Feder,
M.
133
A construction of codes with exponential error bounds on arbitrary discrete
memoryless channels-Uyematsu,
T.,
and Okamoto, E.
134
Restricted two-way channel: bounds for achievable rates region for given error
probability exponents-Haroutunian, E.A., Haroutunian, M.E.,
and Avetissian, A.E.
135
Lattice codes can achieve capacity on the AWGN channel—Urbanke, R.,
and Rimoldi, B.
136
ix
Achieving symmetric capacity of a L-out-of-K Gaussian channel using single-user
codes and successive decoding schemes-Cheng, R.S.
137
Capacity of a memoryless quantum communication channel—Fujiwara,
Α.,
and Nagaoka, H.
138
The effect of a randomly time-varying channel on mutual information—
Medard,
M.,
and
Gallager, R.G.
139
Source coding and transmission of signals over time-varying channels with side
information-Khansari, M., and
Verterli,
M.
140
Session TUAM2 Coding for Recording Channels
One and two dimensional parallel partial response for parallel readout optical
memories-Olson, B.H., and Esener, S.C.
141
Maximum likelihood decoding of block codes on
( 1
-D) partial response channels-
Markarian, G., andHonary, B.
142
Constrained block codes for class-IV PRML channels--Abdel-Ghaffor, K-A-S.,
and Weber, J.H.
143
On efficient high-order spectral-null codes-Tallini, L., Al-Bassam, S.,
and
Bose,
B.
144
Viterbi decoding considering insertion/deletion errors—Mori,
T.,
and Imai, H.
145
Further results on cosets of convolutional codes with short maximum zero-run
lengths-Hole, KJ., and Ytrehus,
0. 146
A new coding technique: integer multiple mark modulation (IMMM)'
Menyennett, C, and
Ferreira, H.C.
147
A class of optimal fixed-byte error protection
codes^S+FbJEC
codes-
Ritthongpitak,
T.,
Fujiwara, E., and
Kitakarni,
M.
148
A forbidden rate region for generalized cross constellations—Gelblum,
EA.,
andCalderbank.A.R.
149
Session TUAM3 Fading Channels I
Efficient multiuser communication in the presence of fading—Wornell, G.W.
150
Information theoretic limits on communication over multipath fading channels-
Buz, R.
151
Computational cutoff rate of BDPSK signaling over correlated Rayleigh fading
channels-Dam, W.C., Taylor, D.P., and Luo, Z.-Q.
152
On the construction of MPSK block codes for fading channels-Portugheis, J.,
and
de Alencar,
CD.
153
Multilevel block coded 8-PSK modulation using unequal error protection codes
for Rayleigh fading channels—Morelos-Zaragoza, R.H.,
Kasami,
T.,
and Lin, S.
154
A change-detection approach to monitoring fading channel bandwidth—
Blostein,
S.D.,
and Liu, Y.
155
On the correlation and scattering functions of mobile uncorrelated scattering
channels-Sadowsky, J.S., and Kafedziski, V.G.
156
High diversity lattices for fading channels-Boutros, J., and Viterbo, E.
157
Real-number DFT codes on a fading channel-Shiu, J., and Wu, J.-L.
158
Session TUAM4 Convolutional Codes
Good k/(k+l) time-varying convolutional encoders from time-invariant
convolutional codes-Yamaguchi, K., and Imai, H.
159
Cascaded convolutional codes-Perez, L.C., and
Costello,
DJ.,
Jr.
160
An algorithm for identifying rate
(n-l)/n
catastrophic punctured convolutional
encoders-Sun, F.-W., and Vinck, AJ.H.
161
Generalized Hamming weights of convolutional codes-Rosenthal, J., and
Von
York, E.
162
Upper bounds on the probability of the correct path loss for list decoding of
fixed convolutional codes—
Johannesson,
R.,
and Zigangirov, K.S.
163
Minimal, minimal-basic, and locally invertible convolutional encoders—
Dholakia,
Α.,
Bitzer, D.L., Koorapaty, H., and Vouk, M.A.
164
First order representations for convolutional encoders—
Rosenthal, J.,
and
Von
York,
E.
165
Some remarks on convolutional codes-Wan, Z.-X.
166
Improved union bound for Viterbi decoder of convolutional codes—
Burnashev, M.V.
167
Session TUAM5 Neural Networks and Learning
Assessing generalization of feedforward neural networks—Turmon, M.J.,
and Fine, T.L.
168
Optimal stopping and effective machine complexity in learning—Wang, C,
Venkatesh,
S.S.,
and Judd, J.S.
169
On batch learning in a binary weight setting-Fang, S.C., and Venkatesh,
S.S. 170
Pattern recognition via match between coded patterns and feature vectors-
Lee, L.L., and
Sosa, B.R.M.
171
Training recurrent networks using Hessian information—Coelho, P.H.G.
172
An artificial neural net Viterbi decoder-Wang, X.-A., and Wicker, S.B.
173
Combining neural network classification with fuzzy vector quantization and
hidden Markov models for robust isolated word speech recognition—
Xydeas, C.S., and Cong, L.
174
An EM-based algorithm for recurrent neural networks—Ma, S., and Ji,
С
175
Session TUAM6 Estimation
Sufficient conditions for norm convergence of the EM algorithm—Hero,
Α.,
and
Fessier, J.
176
Deterministic EM algorithms with penalties—O'Sullivan, J.A., and Snyder, D.L.
177
Hidden Markov models estimation via the most informative stopping times for
Viterbi algorithm-Kogan, J.A.
178
Model parameter estimation for 2D noncausal Gauss-Markov random fields—
Cusani, R., Baccarelli, E., and
Galli, S.
179
Achievable regions in the bias-variance plane for parametric estimation problems-
Hero, A.
,
and Usman,
M
. 180
Session TUAM7 Codes for the Gaussian Channel
New spherical designs in three and four dimensions-Hardin, R.H., and
Sloane,
N.J.
A.
181
Computing the Voronoi cell of a lattice: The diamond-cutting algorithm—
Viterbo, E., and Biglieri, E.
182
A new sphere packing in 20-dimensional Euclidean space—Vardy, A.
183
Asymptotically optimal spherical codes-Hamkins, J., and Zeger, K.
184
Applications of TCM with
σ
-tree
constellations over the AWGN channel-
Zaidan, M.Y., Barnes,
CF.,
and Wicker, S.B.
185
Generalized minimum distance decoding of Reed-Muller codes and Barnes-Wall
lattices-Wang, C, Shen,
В.,
and Tzeng, K.K.
186
Constellation shaping for the Gaussian channel—Heegard,
С
187
Random exploration of the three regular polytopes-Blachman,
N.M. 188
Codes for the Lee metric and lattices for the
1,
-distance—
Siala,
M.,
and Kaleh, G.K.
189
X)
Session TUPMl Rate
Distortion Theory
On the redundancy of lossy source coding-Zhang, Z., Yang, E.-H., and Wei, V.K.
190
Mutual information and mean square error-Ihara, S.
191
Critical distortion of Potts model--Ye, Z.
,
and
Berger, T.
192
On the role of mismatch in rate distortion theory—Lapidoth, A.
193
On rate-distortion bounds of sub-Gaussian random vectors—
Müller, F. 194
Rate distortion efficiency of subband coding with
crossband
prediction—Wong, P.W.
195
Operational rate distortion theory-Sadeh, I.
196
Distortion measures for variable rate coding-McCIellan,
S.A.,
and Gibson, J.D.
197
Multiple-access channels with correlated sources
-
coding subject to a fidelity
criterion-Salehi, M.
198
Session TUPM2 Coding for Constrained Channels
Coding for channels with cost constraints-Khayrallah, A.S., and
Neuhoff, D.L. 199
On the capacity of
M
-агу
run-length-limited codes-McLaughlin,
S.W.,
Luo, J.,
and Xie, Q.
200
Joint multilevel RLL and error correction coding—Siala, M., and Kaleh, G.K.
201
(4,20)
Runlength limited modulation code for high density storage system-
Kim, M.-G., and Lee, J.H.
202
On properties of binary maxentropic DC-free runlength-limited sequences—
Braun, V.
203
Coding for low complexity detection of multiple insertion/deletion errors-
Clarke, W.A., and
Ferreira, H.C.
204
Single-error-correcting codes for magnetic recording—Levitin,
LB.,
and
Vainstein, F.S.
205
Single-track Gray codes-Hiltgen, A.P., Paterson, K.G., and
Brandestini,
M.
206
Optimizing the encoder/decoder structures in a discrete communication system—
Khandani, A.K.
207
Session TUPM3 Fading Channels II
The effect of space diversity on coded modulation for the fading channel—
Ventura-Traveset, J.,
Caire, G.,
and Biglieri, E.
208
Multilevel concatenated coded modulation schemes for the shadowed mobile
satellite communication channel—Rhee,
DJ.,
and Lin, S.
209
A hidden Markov model (HMM)-based MAP receiver for Nakagami fading
channels-Kong, H., and Shwedyk, E.
210
Polynomial representation of burst error statistics—Kittel, L.
211
Coherent detection for transmission over severely time and frequency dispersive
multipath fading
channels-Bejjani,
E., Belfiore,
J.-C., and Leclair, P.
212
Optimised multistage coded modulation design for Rayleigh fading channels-
Burr, A.G.
213
Distributed reception of fading signals in noise-Blum, R.S.
214
Performance of trellis coded direct-sequence spread-spectrum with noncoherent
reception in a fading environment—Cheng, V.W., and Stark, W.E.
215
Reliable communication over the Rayleigh fading channel with I-Q TCM--
Al-Semari,
S.A.,
and
Fuja,
Т.Е. 216
A highly adaptive high-speed wireless transceiver—Pottie,
G
J.
217
Session TUPM4 Decoding of Convolution^ Codes
Adaptive forward error control shemes in channels with side information at the
transmitter-Larrea-Arrieta, J., and
Tait,
DJ. 218
хи
Novel scarce-state-transition
syndrome-former error-trel
lis
decoding of
(
n, n-
1 )
convolutional codes-Lee,
L.H.C.
,
Tait,
DJ.,
Farrell, P.G.,
and Leung,
P.S.C.
219
Construction of trellis codes at high spectral efficiencies for use with sequential
decoding-Wang, F.-Q., and
Costello, D.J.,
Jr.
220
Real number convolutional code correction and reliability calculations in
fault-tolerant systems—Redinbo, R.
221
Bidirectional Viterbi decoding algorithm with repeat request and estimation of
unreliable region—Tajima,
M
. 222
Reduced complexity algebraic type Viterbi decoding of q-ary convolutional codes-
Zigangirov, K.S.
223
On the general threshold decoding rule and related codes—Peng, X.-H.,
and Farrell, P.G.
224
Optimum distance profile trellis encoders for sequential decoding-Ljungberg, P.
225
Error burst detection with high-rate convolutional codes—Said, A.
226
A table-based reduced complexity sequential decoding algorithm—
Koorapaty, H., Bitzer, D.L., Dholakia,
Α.,
and Vouk, M.A.
227
Session TUPM5
MDL
and Learning
Characterization of the
Bayes
estimator and the
MDL
estimator for exponential
families-Takeuchi, J.-I.
228
Concept learning using complexity regularization—Lugosi, G., and Zeger, K.
229
M
ini
max redundancy through accumulated estimation error—Yu, B.
230
An algorithm for designing a pattern classifier by using
MDL
criterion-
Tsuchiya, H., Itoh, S., and Hashimoto, T.
231
An extension on learning Bayesian belief networks based on
MDL
principle-
Suzuki, J.
232
Optimal universal learning and prediction of probabilistic concepts—
Feder,
M.,
Freund,
Y., and Mansour, Y.
233
Session TUPM6
Combinatorics and Coding
Covering
radius 1985-1994-Cohen, G.D., Litsyn, S.N., Lobstein,
Α.,
and Mattson, H.F.,
Jr.
234
Greedy generation of non-binary codes—Monroe, L., and Pless, V.
235
Lee distance Gray codes—
Bose,
В.,
and Broeg, B.
236
Diffuse difference triangle sets-Kleve,
T.,
and Svirid, Y.V.
237
Two classes of binary optimum constant-weight codes—
Fu,
F.-
W.,
and
Shen, S.-Y.
238
Tensor codes for the rank metric-Roth, R.M.
239
On the asymptotic properties of a class of linearly expanded maximum distance
separable codes—Ray-Chaudhuri, S.
240
Generalized partial spreads, geometric forms of bent functions-Carlet,
С
241
Constructing covering codes via noising-Charon, I., Hudry, O., and Lobstein, A.
242
Session TUPM7 Two Dimensional Channel Coding
On the diamond code construction-Baggen, C.P.M J., and Tolhuizen, L.M.G.M.
243
A five-head, three-track, magnetic recording
channel-Soljanin, E.,
and
Georghiades, C.N.
244
Multi-track MSN codes for magnetic recording channels—Kurtas, E.,
Proakis, J.G., and Salehi, M.
245
MDS array codes with independent parity symbols-Blaum, M.,
Brück,
J.,
and Vardy, A.
246
XIII
On the capacity rates of two-dimensional runlength limited codes—Ye, Z., and
Zhang, Z.
247
Physical limits on the storage capacity of magnetic recording media-
Porter, D.G., and O'Sullivan, J.A.
248
Entropy estimates for simple random fields-Forchhammer, S., and Justesen, J.
249
Wavelets and lattice spaces-Moon,
Т.К. 250
Session WEAM1 Nonparametric Estimation and Classification
Nonparametric regression estimation for arbitrary random processes—
Posner, S.E., and
Kulkami, S.R.
251
Model selection criteria and the orthogonal series method for function estimation-
Moulin, P.
252
On nonparametric curve estimation with compressed data—
Pawlak,
M.,
and
Stadtmüller, U. 253
Complexity regularization using data-dependent penalties—Lugosi, G., and
Nobel, A.
254
On the existence of strongly consistent rules for estimation and classification-
Kulkami, S.R., and Zeitouni, O.
255
к
nearest neighbors in search of a metric—Snapp, R.R., and Venkatesh,
S.S. 256
An information-theoretic framework for optimization with application to supervised
learning-Miller, D., Rao,
Α.,
Rose, K., and Gersho, A.
257
Nonparametric classification using radial basis function nets and empirical risk
minimization—
Krzyżak,
Α.,
Under,
T.,
and Lugosi, G.
258
Universal, nonlinear, mean-square prediction of Markov processes-Modha,
D.S.,
and Masry, E.
259
Session WEAM2 New Directions in Data Compression
The quadratic Gaussian CEO problem-Viswanathan, H., and
Berger, T.
260
Gaussian muMterminal source coding-Oohama, Y.
261
Multilevel diversity coding with symmetrical connectivity—Roche, J.R.,
Yeung, R.W.,
and
Hau, K.P. 262
An error exponent for lossy source coding with side information at the decoder—
Jayaraman, S., and
Berger, T.
263
Error exponents for successive refinement by partitioning—Kanlis,
Α.,
and
Narayan, P.
264
Remote coding of correlated sources with high resolution—Zamir, R., and
Berger, T.
265
A sliding window Lempel-Ziv algorithm for differential layer encoding in
progressive transmission—Subrahmanya, P., and
Berger, T.
266
On the compression dimension of data strings and data sets-Kieffer, J., and
Nelson, G.
267
Session WEAM3 Synchronization and Interference in Communication
Systems
Optimal linear receivers for synchronizing
pseudo
random sequences—
Dabak, A.G. 268
Maximum likelihood synchronization and frequency measurements-
Collins, O.M., and Zhuang, Z.
269
Multilevel coding to combat quantization of the sum of the transmitted signal, a
noise and a known interference-Herzberg, H., and Saltzberg, B.R.
270
Probability distribution of differential phase perturbed by tone interference and
its application-Zeng, M., and Wang, Q.
271
Cyclotomic cosets and steady state solutions to a dynamic jamming game—
Maliik,
R.K.
,
and Scholtz, R.A.
272
XIV
Duration of a search for a fixed pattern in random data: the distribution runction-
Bajic, D.,
Drajić,
D., and
Kató,
O.
273
Session WEAM4 Cyclic Codes
New codes with the same weight distributions as the Goethals codes and the
Delsarte-Goethals codes-Heileseth,
T.,
Kumar, P.V., and Shanbhag, A.G.
274
A cyclic
[6,3,41
group code and the hexacode over GF(4)-Ran, M., and
Snyders, J.
275
Decoding binary expansions of low-rate Reed-Solomon axles far beyond the
BCH bound-Retter, C.T.
276
Multisequence generation and decoding of cyclic codes over
Z,—
Interlando, J.C.,
and Palazzo, R., Jr.
277
On the maximality of BCH codes-Levy-dit-Vehel,
F.,
and Litsyn, S.
278
Weights of long primitive binary BCH-codes are not binomially distributed-
Lazic,
D.E.,
Kalouti, H., and Beth, T.
279
On decoding doubly extended Reed-Solomon codes—Jensen, J.M.
280
The generalized Hamming weight of some BCH codes and related codes-
Helleseth,
T.,
and Winjum, E.
281
Cyclic codes and quadratic residue codes over Z4—Pless, V., and Qian, Z.
282
Improved estimates for the minimum distance of weighted degree Z4 trace
codes-Helleseth,
T.,
Kumar, P.V., Moreno, O., and Shanbhag, A.G.
283
Session WEAM5 Modeling and Analysis of Communication Systems
Representation of nonlinear OQPSK-type modulated waveforms as a sum of
linear OQPSK-components—
Gusmão,
Α.,
and
Gonçalves,
V.
284
Properties of guided scrambling encoders and their coded sequences-
Fair, I J., Bhargava, V.K., and Wang, Q.
285
Channel codes that exploit the residual correlation in CELP-encoded speech—
Alajaji,
F.,
Phamdo, N., and
Fuja,
T.
286
Modal analysis of linear nonbinary block codes used on stochastic finite state
channels—Zepernick, H.-J.
287
Decoding procedure capacities for the Gilbert-Elliott channel-Bratt, G.,
Johannesson,
R.,
and Zigangirov, K.S.
288
Real-time channel estimation using fuzzy logic—Arani,
F.,
Śmietana, R.,
and
Honary,
В.
289
Diversity waveform sets for high-resolution delay-doppler imaging—Guey, J.-C.,
and Bell, M.R.
290
Reduced complexity symbol-by-symbol demodulation-Fitz, M.P., and
Gelfand, S.B. 291
The representation of multicomponent chirp signals using frequency-shear
distribution-Yao, S., and He, Z.Y.
292
Session WEAM6 Signal Detection
A paradigm for distributed detection under communication constraints—Yu, C.-T.,
and Varshney, P.K.
293
Decentralized quickest change detection—Veeravalli, V.
294
Performance loss computation in distributed detection—Amirmehrabi, H., and
Viswanathan, R.
295
HOS-based noise models for signal-detection optimization in non-Gaussian
environments—Tesei,
Α.,
and Regazzoni, C.S.
2%
Optimum detection of Gaussian signals in non-Gaussian noise-Buzzi, S.,
Conte, E.,
and Lops, M.
297
xv
Asymptotically robust detection using statistical moments-Kolodziejski, K.R.,
and Betz, J.W.
298
Conditional testing in two-input detectors with single input conditioning—
Seyfe,
В.,
and Kahrizi, M.
299
Signal detection in continuous-time white Gaussian channel—Ihara, S., and
Sakuma, Y.
300
A recursive formulation for quadratic detection on Rayleigh fading channels—
Castoldi, P., and Raheli, R.
301
Robust detection of impulse signals in random impulse interferences—
Grishin, Y.P.,
Sokolov,
A.I., and Yurchenko, Y.S.
302
WEAM7
-
Room EL4 Group Codes
Rotating group codes for the
ISI
channel—Massey, P., and Mathys, P.
303
Oñ
the trellis of convolutional codes over groups—Loeliger, H.-A.
304
Minimality tests for rational encoders over rings—Mittelholzer, T.
305
Permutation decoding of group codes-Biglieri, E.
306
On the algebraic fundamentals of convolutional encoders over groups—Arpasi, J.P.,
and Palazzo, R., Jr.
307
Useful groups for trellis codes-Sarvis, J.P., and
Trott, M.D. 308
Codes from iterated maps-
Andersson,
H.,
and Loeliger, H.-A.
309
On binary-to-q-ary codes over groups—Wilhelmsson, L.
310
Abelian group codes, duality and Mac Williams identities—
Ericson,
T.,
and
Zinoviev, V.
311
Session THAM1 Multiuser Systems
Detection of spread-spectrum signals for linear multi-user receivers—
Mitra, U.,
and Poor, H.V.
312
MMSE interference suppression for joint acquisition and demodulation in
CDMA systems-Madhow, U.
313
Orthogonally anchored blind interference suppression using the Sato cost criterion—
Honig, M.L. 314
Optimal son multi-user decoding for vector quantization in a synchronous
CDMA
system-Skoglund,
M.,
and
Ottosson, T.
315
Linear multiuser detectors for synchronous code-division multiple-access systems
with continuous phase modulation—Papasakellariou,
Α.,
and Aazhang, B.
316
A near ideal whitening filter for M-algorithm detection in an asynchronous
time-varying CDMA system—Wei, L., and
Rasmussen, L.K.
317
A new projection receiver for coded synchronous multi-user CDMA systems—
Schlegel,
С,
and Xiang, Z.
318
Adaptive multilevel coding associated with
CCI
cancellation for CDMA—
Saimddin,
Α.,
and Kohno, R.
319
Performance bounds for decorrelator detectors in a QS-CDMA system—
Iltis, R.A. 320
A non-orthogonal synchronous DS-CDMA case, where successive cancellation
and maximum-likelihood multiuser detectors are equivalent—Kempf, P.
321
Session THAM2 Entropy and Noiseless Source Coding
An inequality on guessing and its application to sequential decoding—Arikan, E.
322
Weighted coding methods for binary piecewise memoryless sources-
Willems,
F.,
and Casadei, F.
323
A D-ary Huffman code for a class of sources with countably infinite alphabets-
Kato,
Α.,
Han, T.S., and Nagaoka, H.
324
XVI
Data expansion with Huffman codes—Cheng, J.-F., Dolinar, S., Effros, M.,
and McEliece, R.
325
Minimizing the maximum codeword cost-Abrahams,
J
. 326
Entropy reduction, ordering in sequence spaces, and semigroups of non-negative
matrices-Hollmann, H.D.L., and Vanroose, P.
327
Variable-to-fixed length codes and the conservation of entropy-Savari,
S.A. 328
An inequality on entropy—McEliece, R.J., and Yu, Z.
329
On entropies, divergences, and mean values—Basseville, M., and Cardoso, J.-F.
330
Session THAM3 Dispersive Channels and Equalization I
When are the MLSD respectively the matched filter receiver optimal with respect
to the
BER-Ödling,
P., Eriksson, H.B.,
Koski,
T.,
and
Börjesson,
P.O.
331
A genie-aided detector with a probabilistic description of the side information-
Eriksson, H.B.,
Odling,
P.,
Koski,
T.,
and
Börjesson,
P.O.
332
A new family of decision delay-constrained MAP decoders for data transmission
over noisy channels with
ISI
and soft-decision demodulation—
Baccarelli, E., Cusani, R., and
Di
Blasio, G.
333
MMSE-Optimal feedback and its applications—
Tarköy, F. 334
A comparison of a single-carrier system using a DFE and a coded OFDM
system in a broadcast Rayleigh-fading channel-Wilson, S.K., and Cioffi, J.M.
335
A decision feedback filter-Gel
fand, S.B.,
and
Fitz, M.P., 336
Combined decision feedback equalization and coding for high
SNR channels-
Yellin, D., Vardy,
Α.,
and Amrani, O.
337
Maximum likelihood sequence estimation for non-Gaussian band-limited channels-
Cordier, M., and Geraniotis, E.
338
Incoherent diversity detection of fading signals in correlated non-Gaussian noise-
Izzo, L., and
Tanda,
M.
339
Statistics of error recovery times of decision feedback equalizers-Choy, W.W.,
and Beaulieu, N.C.
340
Session THAM4 Structure of Block Codes
A lower bound on the undetected error probability of block codes-
Abdel-Ghaffar, K.A.S.
341
The worst-case probability of undetected error for linear codes on the local
binomial channel—Kleve, T.
342
Good error detection codes satisfy the expurgated bound-Hashimoto, T.
343
On the binomial approximation to the distance distribution of codes-
Krasikov, I., and Litsyn, S.
344
Extensions of linear codes—Hill, R., and
Lizak,
P.
345
Tabu search in coding theory—Nurmela,
K.J.,
and
Östergard,
P.R
J.
346
Reducing the complexity of trellises for block codes—
Aguado-Bayón, L.E.,
and Farrell, P.G.
347
Canonical representation of quasi-cyclic codes—Esmaelli, M., Gulliver, T.A.,
andSecord, N.P.
348
Newton's identities for minimum codewords of a family of alternant codes--
Augot, D.
349
Session THAM5 Cryptographic Techniques
Information theoretical lower bounds lor unconditionally secure group
authentication-Gehrmann, C.
350
Spectral properties and information leakage of multi-output Boolean functions—
Youssef, A.M., and
Tavares,
S.E. 35]
Cryptographic redundancy and mixing functions—Collins, O.
352
Design of the extended-DES cryptography-Oh, H.-S., and Han, S.-J.
353
XVII
Constructions
of asymmetric authentication systems-Johansson, T.
354
Two simple schemes for access control-Chan, M.Y., and Yeung, R.W.
355
Attacks on Tanaka's non-interactive key sharing scheme-Park, S., Kim, Y., Lee, S.,
and Kim, K.
356
Simply implemented identity-based non-interactive key
sharing-Tanaka, H.
357
The degeneration and linear structures of
multi
-valued logical functions-
Feng, D.-G., Liu,
В.,
and Xiao, G.-Z.
358
A fast identification scheme-Veron, P.
359
Session THAM6 Image Processing
Transmission of two-tone images over noisy channels with memory—Burlina, P.,
Alajaji,
F.,
and Chellappa, R.
360
Multilevel resolution of digital binary images-Koplowitz, J., and
DeLeone, J.
361
A new efficient coding method of a still image using three-dimensional DCT--
Kondo, H., Agus, S., and
Komori,
S.
362
Nonlinear filters in joint source channel coding of images—Khayrallah, A.S.
363
The polynomial phase difference operator for parametric modeling of 2-D
nonhomogeneous signals-Friedlander,
В.,
and Francos, J.M.
364
Adaptive image restoration using discrete polynomial transforms—Neyt, X., and
Acheroy, M.
365
Extreme elements and granulometries in the estimation problem-Villalobos, I.R.T.
366
A noise tolerant algorithm for the object recognition of warning system—
Kang,
O.S. 367
Variable step search algorithm for motion estimation-Cai, Z.Q., and
Tran, V.N. 368
A simple, general and mathematically tractable sense of depth-Saadat,
Α.,
and Fahimi, H.
369
Session THAM7 Quantization
On the cost of finite block length in quantizing unbounded memoryless sources—
Under,
T.,
and Zeger, K.
370
Universal quantization of parametric sources has redundancy k/2 logn/n—
Chou,
P.A.,
Effros, M., and Gray, R.M.
371
On the encoding complexity of scalar quantizers-Hui, D., and
Neuhoff, D.L. 372
Reduced-complexity waveform coding via alphabet partitioning-Said,
Α.,
and
Pearlman, W.A.
373
Some results on quantization of a narrowband process—
Bist,
A.
374
A statistical analysis of adaptive quantization based on causal past—Yu, B.
375
Probability quantization for multiplication-free binary arithmetic coding-
Cheung, K.-M.
376
Affine
index assignments for binary lattice quantization with channel noise—
Méhes,
Α.,
and Zeger, K.
377
Optimal quantization for finite state channels-Duman, T.M., and Salehi, M.
378
Performance of the adaptive quantizer-Pilipchouk, N.I.
379
Session THPM1 Multiuser Communications
Combined multipath and spatial resolution for multiuser detection: potentials
and problems-Huang, H.C., Schwartz, S.C., and
Verdú, S.
380
Multi-user communication with multiple symbol rates-Honig, M.L., and Roy, S.
381
Multisensor multiuser receivers for time-dispersive multipath fading channels—
Stojanovic, M., and
Zvonar,
Ζ.
382
An iterative multiuser receiver: the consensus detector-Grant, AJ., and
Schlegel,
С.
383
Blind multiuser deconvohuion in fading and dispersive channels-
Fonollosa, J.R., Fonollosa, J.A.R.,
Zvonar,
Ζ.,
and
Vidal, J.
384
XVIII
On the least possible decoding error probability for truly asynchronous single
sequence hopping—Csibi, S.
385
On the performance of partial-response DS/SS systems in a specular multipath
environment-Wang, Y.-R, and Stark, W.E.
386
Distributed access control in wireline and wireless systems-Hansen, CJ., and
Pottie, GJ.
387
Session THPM2 Lossless Source Coding
A Bayes
coding algorithm for FSM sources—Matsushima,
T.,
and Hirasawa, S.
388
A CTW scheme for some FSM models-Suzuki, J.
389
On tree sources, finite state machines, and time reversal—Seroussi, G., and
Weinberger, M.
390
Approximation of
Bayes
code for Markov sources-Takeuchi, J.-I., and Kawabata, T.
391
Markov random field models for natural language —Mark, K.E., Miller, M.I.,
and
Grenander,
U.
392
A multialphabet arithmetic coding with weighted history model-Hsieh, M.-H.,
and Wei. C.-H.
393
Bit-wise arithmetic coding for data compression-Kiely,
A.B. 394
Fast enumerative source coding—Ryabko, B.
395
Session THPM3 Dispersive Channels and Equalization II
A new spectral shaping scheme without
subcarriers—
Yang, Y., and Welch, L.R.
396
On optimizing multicarrier transmission—
Willink,
TJ.,
and Wittke, P.H.
397
Multitene
modulation and demodulation for channels with
SNR
uncertainty—
Baum,
C.W., and Conner, K.F.
398
Achievable rates for Tomlinson-Harashima precoding-
Wesel, R.D.,
and Cioffi, J.M.
399
Phase-shifted linear partial-response modulation-Said,
Α.,
and Anderson, J.B.
400
Self-training adaptive equalization for multilevel partial-response transmission
systems—Cherubim,
G., Olçer, S.,
and Ungerboeck, G.
401
On the existence and uniqueness of joint channel and data estimates-Chugg,
K.M.,
and Polydoros, A.
402
Data detection of coded PSK in the presence of unknown carrier phase-
Nassar, C.R., and Soleymani, M.R.
403
Delayed decision feedback equalization—Varanasi, M.K.
404
Tree search algorithms for self-adaptive maximum-likelihood sequence estimation-
Paris, B.-P., and Shah, A.R.
405
Modified/quadrature partial response-trellis coded modulation (M/QPR-TCM)
systems—Uçan, O.N.
406
Session THPM4 Decoding Block Codes
Soft decoding employing algebraic decoding beyond
e^-Nilsson, J.E.M
. 407
The algebraic decoding of the Z4-linear Goethals code-Helleseth,
T.,
and Kumar, P.V.
408
The Welch-Berlekamp and Berlekamp-Massey algorithms-Blackburn, S.R.
409
The optimal erasing strategy for concatenated codes—Hsuan, Y., Coffey, J.T.,
and Collins,
O AI.
410
Error and erasure decoding of binary cyclic code up to actual
minimum
distance-
Lee, H., Tzeng, K.K., and Chen,
С
J.
411
Enhanced decoding of interleaved error correcting codes-Blaum, M., and
van Tilborg, H.C.A.
412
A decoding algorithm for linear codes over Z4—Goel,
M
.,
and
Rajan,
B .S
. 413
Decoding linear block codes using optimization techniques-Shih, C.-C.,
Wulff, C.R., Hartmann, C.R.P.,
and Mohan, C.K.
414
XIX
On maximum likelihood soft decision syndrome decoding—Fossorier, M.P.C,
Lin, S., and Snyders, J.
415
Fast error magnitude evaluations for Reed-Solomon codes—
Komo,
J J.,
and Joiner, L.L.
416
On neural decoding for some cyclic codes--Yu, J.-P., Zhao, Y.-B., and Wang, X.-M.
417
Session THPM5 Random Processes
Poisson
approximation for excursions of adaptive algorithms-Zerai,
A.A.,
and
Bucklew, J.A.
418
Additive random sampling and exact reconstruction-Lacaze,
В.,
and Duverdier, A.
419
Distortion measures via parametric filtering—Li, T.-H., and Gibson, J.D.
420
A two-step Markov point process—Hayat, M.M., and Gubner, J.A.
421
Noisy attractors of Markov maps-Salazar-Anaya, G., and Urias, J.
422
Revisiting the Huber-Strassen minimax theorem for capacities—Schwarte, H.,
and Sadowsky, J.S.
423
Hypothesis testing for arbitrarily varying source with exponential-type constraint—
Fu,
F.-W., and Shen, S.-Y.
424
A simple formula for the rate of maxima in the envelope of normal processes
having unsymmetrical spectra-Abdi,
Α.,
and Nader-Esfahani, S.
425
Session THPM6 Wavelets
Measuring time-frequency information and complexity using the
Rényi
entropies—
Baraniuk, R.G.,
Flandrin, P., and Michel, O.
426
Random fields and their wavelet transforms and representation: covariance and
spectral properties-Masry, E.
427
Finite field wavelet transforms and multilevel error protection—
Sarkar,
S.,
and Poor, H.V.
428
Galois theory and wavelet transforms—
Klappenecker,
Α.,
and Beth, T.
429
The discrete-time
biorthogonal
wavelet transform—Sola,
M.Á.,
and Salient, S.
430
Compression of square
integrable
functions: Fourier vs wavelets—
Krichevskii, R.E., and Potapov, V.N.
431
Session THPM7 Trellises, Vectors and Quantization
Generalized vector quantization: Jointly optimal quantization and estimation-
Rao,
Α.,
Miller, D., Rose, K., and Gersho, A.
432
Universal trellis coded quantization-Kasner, J.H., and Marcellin, M.W.
433
Maximum mutual information vector quantization-Wilcox, L.D., and Niles, L.T.
434
Robust quantization for transmission over noisy channels—Chen, Q., and Fischer, T.R.
435
Soft decoding for vector quantization in combination with block channel coding-
Skoglund, M., and Hedelin, P.
436
A fixed-rate trellis source code for memoryless sources—Yang, L., and Fischer, T.R.
437
Why vector quantizers outperform scalar quantizers on stationary memoryless
sources-Neuhoff, D.L.
438
Vector quantization of spherically invariant random processes—
Müller, F.,
and
Geischlager, F.
439
Optimal quantization for distributed estimation via a multiple access channel-
Duman, T.M., and Salehi, M.
440
Vector quantization of images with the ECMPNN algorithm-Comaniciu, D.
441
Session FRAM1 Multiuser Information Theory
A new universal random coding bound for the multiple-access channel-
Liu, Y.-S., and Hughes, B.L.
442
On the factor-of-two bound for Gaussian multiple access channels with feedback-
Ordentlich, E.
443
xx
On the capacity for the
Т
-user
M-frequency noiseless multiple access channel
without intensity information—Vinck, A J.H., Keuning, J., and Kim,
S.W. 444
An extension of the achievable rate region of
Schalkwij k's
1983
coding strategy
for the binary multiplying channel-Meeuwissen, H.B.,
Schalkwijk, J.P.M.
,
and
Bloemen, A.H.A.
445
Interference cancellation in groups-Hanly,
S.V.,
and Whiting,
P.A. 446
Multiterminal estimation theory with binary symmetric source—Shimokawa, H.,
and
Amari, S.-1.
447
Single user coding for the discrete memoryless multiple access channel-
Grant,
Α.,
Rimoldi,
В.,
Urbanke, R., and Whiting, P.
448
Rate-distortion theory for a triangular communication system-Yamamoto, H.
449
Extended Shannon's inequality and the asymptotic capacity of
Т
-user
binary
adder channel-Mow,
W
Л.
450
Session FRAM2 Interactive Communications and Computation
Coding for computing-Orlitsky,
Α.,
and Roche, J.R.
451
Coding for interactive communication—Schulman, LJ.
452
Coding for distributed computation—Rajagopalan, S., and Schulman, LJ.
453
Random access from compressed
datasets
with perfect value hashing—Miller, J.W.
454
Information retrieval from databases-Leung, N.K.N., Coffey, J.T., and
Sechrest, S. 455
Information theory and noisy computation-Evans, W.S., and Schulman, L.J.
456
Multiple repetition feedback coding for discrete memoryless channels—Veugen, T.
457
Session FRAM3 Sequences for Synchronization
Extremal polyphase sequences—Golomb,
S.W. 458
A unified construction of perfect polyphase sequences-Mow, W.H.
459
Asymptotic autocorrelation of Golomb sequences—Gabidulin, E.M., Fan, P.Z.,
and Darnell, M.
460
Perfect sequences derived from M-sequences-Darnell, M., Fan, P.Z., and Jin, F.
461
Balanced quadriphase sequences with near-ideal autocorrelations—Fan, PZ.,
and Darnell, M.
462
Quasi-linear synchronization codes-van
Wijngaarden, AJ.
463
Extended sonar sequences-Moreno, O., Golomb,
S.W.,
and
Corrada,
C J.
464
Extended prefix synchronization codes-van
Wijngaarden,
AJ.,
and Morita, H.
465
Maximal prefix synchronized codes by means of enumerarive coding-
Morita, H., van
Wijngaarden,
AJ.,
and Vinck, AJ.H.
466
Partial classification of sequences with perfect auto-correlation and bent functions—
Gabidulin, E.M.
467
Session FRAM4 Iterative Decoding Techniques
Codes and iterative decoding on general graphs—Wiberg, N., Loeliger, H.-A.,
and
Kotter, R.
468
Concatenated coding system with iterated sequential inner decoding-
Jensen, O.R., and Paaske, E.
469
The least stringent sufficient condition on the optimality of suboptimally
decoded codewords-Kasami,
T.,
Koumoto,
T.,
Takata,
T., Fujiwara, T.,
and
lin, S.
470
Implementation and performance of a serial MAP decoder for use in an iterative
turbo decoder-Pietrobon,
S.S. 471
On the convergence of the iterated decoding algorithm-Caire, G., Taricco, G.,
and Biglieri, E.
472
An iterative decoding scheme for serially concatenated convolutional codes—
Siala,
M.,
Papproth,
E., Taieb, K.H.,
and Kalen, G.K.
473
XXI
Soft-decision decoding of binary linear block codes based on an iterative search
algorithm-Moorthy, H.T.,
Lin, S., and
Kasami,
T.
474
A soft output decoding algorithm for concatenated systems—
Wang, X.-A.,
and Wicker, S.B.
475
Session FRAM5 Performance of Optical Communication Systems
On the impact of laser's relaxation oscillation on quadratically detected heterodyned
lightwave signals-Dallal, Y.E., Jacobsen, G., and Shamai (Shitz), S.
476
On a new detection scheme of optical PPM signal—Yamazaki, K.
477
Tight lower bounds on capacity and cutoff rate of DOPPM in optical direct-detection
channel-Ohtsuki,
T.,
Sasase, I., and Mori, S.
478
Bit-error-rate of an optical two-users communications technique-Hassan,
A.A.,
Moinar,
K.J.,
and Imai, H.
479
BER
of optical communication system using fiber source—Nguyen, L., Aazhang,
В.,
and Young, J.F.
480
The channel capacity of hybrid fiber/coax (HFC) networks—Kerpez,
K J.
481
Error probability evaluation of optical systems disturbed by phase noise and
additive noise-Einarsson,
G., Strandberg,
J.,
and Monroy, I.T.
482
Session FRAM6 Cryptographic Structures
Applications of coding and design theory to constructing the maximum resilient
systems of functions-Levenshtein,
V.l. 483
McEliece public key cryptosystems using algebraic-geometric codes—Janwa, H.,
and Moreno, O.
484
Binary trinomials divisible by a fixed primitive polynomial—Games, R.A.,
Key, E.L., and
Rushanan,
J J.
485
New digital multisignature scheme in electronic contract systems—Kang,
CG. 486
The binary symmetric broadcast channel with confidential messages, with
tampering—van
Dijk,
M.
487
Ideal perfect threshold schemes and MDS codes-Blakley, G.R., and Kabatianski, G.A.
488
Product codes and private-key encryption-Campello
de Souza, J.,
and
Campello
de Souza, R.M.
489
On interval linear complexity of binary sequences—Balakirsky, V.B.
490
Session FRAM7 Special Code Constructions
The permutation group of afrme-invariant
codes-Berger, T.P.,
and Charpin, P.
491
Mixed^te multiuser codes for the
Т
-user
binary adder channel-Cooper III,
A.B.,
and Hughes, B.L.
492
New quaternary linear codes of dimension
5—
Gulliver, T.A.
493
Hecke
modules as linear block codes and block m-PSK modulation codes-
Zimmermann, K.-H.
494
Reed-Solomon group codes-Zain,
A.A.,
and
Rajan, B.S.
495
A new construction of nonlinear unequal error protection codes-Chiu, M.-C.,
and
Chao,
C.-C.
496
Linear code construction for the 2-user binary adder channel-Cabral,
H.A.,
and
da Rocha,
V.C., Jr.
497
Extending Reed-Solomon codes to modules-Desmedt, Y.
498
Quasi-cyclic Goppa codes-Bezzateev,
S.V.,
and Shekhunova, N.A.
499
New ternary linear codes-Boukliev, I.G. 50O
XXII |
| any_adam_object | 1 |
| author_corporate | International Symposium on Information Theory (Institute of Electrical and Electronics Engineers) Whistler, British Columbia |
| author_corporate_role | aut |
| author_facet | International Symposium on Information Theory (Institute of Electrical and Electronics Engineers) Whistler, British Columbia |
| author_sort | International Symposium on Information Theory (Institute of Electrical and Electronics Engineers) Whistler, British Columbia |
| building | Verbundindex |
| bvnumber | BV010921771 |
| callnumber-first | Q - Science |
| callnumber-label | Q350 |
| callnumber-raw | Q350 |
| callnumber-search | Q350 |
| callnumber-sort | Q 3350 |
| callnumber-subject | Q - General Science |
| classification_rvk | ZN 6015 |
| classification_tum | ELT 505f |
| ctrlnum | (OCoLC)33427660 (DE-599)BVBBV010921771 |
| dewey-full | 003.54 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 003 - Systems |
| dewey-raw | 003.54 |
| dewey-search | 003.54 |
| dewey-sort | 13.54 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Elektrotechnik Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV010921771</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230314</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960829s1995 xx ad|| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0780324536</subfield><subfield code="c">Softbound</subfield><subfield code="9">0-7803-2453-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0780324544</subfield><subfield code="c">Casebound</subfield><subfield code="9">0-7803-2454-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0780324552</subfield><subfield code="c">Microfiche</subfield><subfield code="9">0-7803-2455-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)33427660</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010921771</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">Q350</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">003.54</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 6015</subfield><subfield code="0">(DE-625)157492:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ELT 505f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">International Symposium on Information Theory (Institute of Electrical and Electronics Engineers)</subfield><subfield code="d">1995</subfield><subfield code="c">Whistler, British Columbia</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)5160088-2</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings</subfield><subfield code="b">Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995</subfield><subfield code="c">1995 IEEE International Symposium on Information Theory</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Piscataway, NJ</subfield><subfield code="b">IEEE</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 506 S.</subfield><subfield code="b">Ill., graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information, Théorie de l' - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie information</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datennetz</subfield><subfield code="0">(DE-588)4011130-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1995</subfield><subfield code="z">Whistler British Columbia</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Telekommunikationsnetz</subfield><subfield code="0">(DE-588)4133586-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Datennetz</subfield><subfield code="0">(DE-588)4011130-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung TU Muenchen</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007305353&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007305353</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1995 Whistler British Columbia gnd-content |
| genre_facet | Konferenzschrift 1995 Whistler British Columbia |
| id | DE-604.BV010921771 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:21:47Z |
| institution | BVB |
| institution_GND | (DE-588)5160088-2 |
| isbn | 0780324536 0780324544 0780324552 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007305353 |
| oclc_num | 33427660 |
| open_access_boolean | |
| owner | DE-739 DE-91 DE-BY-TUM DE-83 DE-706 |
| owner_facet | DE-739 DE-91 DE-BY-TUM DE-83 DE-706 |
| physical | XXII, 506 S. Ill., graph. Darst. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| publisher | IEEE |
| record_format | marc |
| spelling | International Symposium on Information Theory (Institute of Electrical and Electronics Engineers) 1995 Whistler, British Columbia Verfasser (DE-588)5160088-2 aut Proceedings Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 1995 IEEE International Symposium on Information Theory Piscataway, NJ IEEE 1995 XXII, 506 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Information, Théorie de l' - Congrès ram théorie information inriac Information theory Congresses Datennetz (DE-588)4011130-1 gnd rswk-swf Informationstheorie (DE-588)4026927-9 gnd rswk-swf Telekommunikationsnetz (DE-588)4133586-7 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1995 Whistler British Columbia gnd-content Informationstheorie (DE-588)4026927-9 s DE-604 Telekommunikationsnetz (DE-588)4133586-7 s 1\p DE-604 Datennetz (DE-588)4011130-1 s 2\p DE-604 Digitalisierung TU Muenchen application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007305353&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Proceedings Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 Information, Théorie de l' - Congrès ram théorie information inriac Information theory Congresses Datennetz (DE-588)4011130-1 gnd Informationstheorie (DE-588)4026927-9 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd |
| subject_GND | (DE-588)4011130-1 (DE-588)4026927-9 (DE-588)4133586-7 (DE-588)1071861417 |
| title | Proceedings Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 |
| title_auth | Proceedings Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 |
| title_exact_search | Proceedings Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 |
| title_full | Proceedings Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 1995 IEEE International Symposium on Information Theory |
| title_fullStr | Proceedings Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 1995 IEEE International Symposium on Information Theory |
| title_full_unstemmed | Proceedings Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 1995 IEEE International Symposium on Information Theory |
| title_short | Proceedings |
| title_sort | proceedings whistler conference centre whistler british columbia canada 17 22 september 1995 |
| title_sub | Whistler Conference Centre, Whistler, British Columbia, Canada, 17 - 22 September, 1995 |
| topic | Information, Théorie de l' - Congrès ram théorie information inriac Information theory Congresses Datennetz (DE-588)4011130-1 gnd Informationstheorie (DE-588)4026927-9 gnd Telekommunikationsnetz (DE-588)4133586-7 gnd |
| topic_facet | Information, Théorie de l' - Congrès théorie information Information theory Congresses Datennetz Informationstheorie Telekommunikationsnetz Konferenzschrift 1995 Whistler British Columbia |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007305353&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT internationalsymposiumoninformationtheoryinstituteofelectricalandelectronicsengineerswhistlerbritishcolumbia proceedingswhistlerconferencecentrewhistlerbritishcolumbiacanada1722september1995 |