Coding Theory and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540193685, 9783540392439

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimum ’1’ — Ended binary prefix codes

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_7 ◽

1988 ◽

pp. 68-75

Author(s):

Toby Berger ◽

Raymond Yeung

Keyword(s):

Prefix Codes

Download Full-text

A lower bound on the minimum euclidean distance of trellis codes

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_14 ◽

1988 ◽

pp. 130-140

Author(s):

Marc Rouanne ◽

Daniel J. Costello

Keyword(s):

Lower Bound ◽

Euclidean Distance ◽

Trellis Codes ◽

Minimum Euclidean Distance

Download Full-text

A [32,17,14]-geometric code coming from a singular curve

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_11 ◽

1988 ◽

pp. 106-115 ◽

Cited By ~ 2

Author(s):

D. Brigand

Keyword(s):

Singular Curve

Download Full-text

Information theory in random fields

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_1 ◽

1988 ◽

pp. 1-18 ◽

Cited By ~ 1

Author(s):

Toby Berger

Keyword(s):

Information Theory ◽

Random Fields

Download Full-text

Projective reed-muller codes

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_13 ◽

1988 ◽

pp. 125-129 ◽

Cited By ~ 5

Author(s):

Gilles Lachaud

Download Full-text

On the density of best coverings in hamming spaces

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_4 ◽

1988 ◽

pp. 39-44 ◽

Cited By ~ 2

Author(s):

M. Beveraggi ◽

G. Cohen

Download Full-text

On modular weights in arithmetic codes

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_6 ◽

1988 ◽

pp. 56-67 ◽

Cited By ~ 2

Author(s):

Antoine Lobstein

Keyword(s):

Arithmetic Codes

Download Full-text

Specification, synchronisation, a verage length

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_9 ◽

1988 ◽

pp. 86-95 ◽

Cited By ~ 4

Author(s):

Anne Bertrand

Download Full-text

Adapted codes for communication through multipath channel

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_19 ◽

1988 ◽

pp. 173-182 ◽

Cited By ~ 1

Author(s):

G. Hakizimana ◽

G. Jourdain ◽

G. Loubet

Keyword(s):

Multipath Channel

Download Full-text

A weighted-output symbol-by-symbol decoding algorithm of binary convolutional codes

Coding Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/3-540-19368-5_17 ◽

1988 ◽

pp. 154-158

Author(s):

J. C. Belfiore

Keyword(s):

Convolutional Codes ◽

Decoding Algorithm ◽

Output Symbol

Download Full-text

Coding Theory and Applications - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Optimum ’1’ — Ended binary prefix codes

A lower bound on the minimum euclidean distance of trellis codes

A [32,17,14]-geometric code coming from a singular curve

Information theory in random fields

Projective reed-muller codes

On the density of best coverings in hamming spaces

On modular weights in arithmetic codes

Specification, synchronisation, a verage length

Adapted codes for communication through multipath channel

A weighted-output symbol-by-symbol decoding algorithm of binary convolutional codes

Coding Theory and Applications - Lecture Notes in Computer Science
Latest Publications