𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear time tree codes

✍ Scribed by G. Tinhofer; H. Schreck

Publisher
Springer Vienna
Year
1984
Tongue
English
Weight
776 KB
Volume
33
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Binary tree gray codes
Binary tree gray codes
✍ Andrzej Proskurowski; Frank Ruskey πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 619 KB
The construction of periodically time-va
The construction of periodically time-variant convolutional codes using binary linear block codes
✍ Naonori Ogasahara; Manabu Kobayashi; Shigeichi Hirasawa πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 483 KB

## Abstract In 1996 Rosenthal and York proposed (time‐invariant) BCH convolutional codes [4] in which the parity check matrix of a BCH code is used in the construction of the convolutional code. The lower bound on the minimum free distance of a BCH convolutional code is guaranteed by the BCH limit.

Linear intersecting codes
Linear intersecting codes
✍ GΓ©rard Cohen; Abraham Lempel πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 358 KB

We study pairs of binary linear codes Cl(n, nR1), C2(n, nR 2) with the property that for any nonzero cl c C~ and c2~ C 2, there are coordinates in which both c, and c 2 are nonzero.

Optimal one-page tree embeddings in line
Optimal one-page tree embeddings in linear time
✍ Robert A. Hochberg; Matthias F. Stallmann πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 167 KB

In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for