✦ LIBER ✦

Sequence matching with binary codes

✍ Scribed by James H. Bradford

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 334 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90159-u

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear binary codes with intersection pr

Linear binary codes with intersection properties

✍ D. Miklós 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Quasi-synchronous code division multiple

Quasi-synchronous code division multiple access (CDMA) with binary shift-register sequences

✍ Seiji Kuno; Takaya Yamazato; Masaaki Katayama; Akira Ogawa 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 845 KB

Multilevel coding modulation system with

Multilevel coding modulation system with binary block codes

✍ E.C.G. Wille; W. Godoy Jr. 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 96 KB

This paper proposes an original system for the attainment of codes for multilevel coding modulation. These codes are made up of short binary block codes and are found through computer search. Some of these codes are shown here. The decoding of the proposed codes is easy, due to its binary representa

Binary Phase Coded Sequence Generation U

Binary Phase Coded Sequence Generation Using Fractional Order Logistic Equation

✍ B. T. Krishna 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 462 KB

Optimal binary prefix-condition codes wi

Optimal binary prefix-condition codes with ordinal probabilities

✍ Greenberg, Irwin 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

Probability estimates for letters in a finite alphabet are derived in order to apply the Huffman algorithm to determine an optimal binary prefix-condition code. The estimates maximize the entropy subject to constraints specifying second-level orderings of the letters' iikeiihoods. These are compared

Optimal sequence estimation for convolut

Optimal sequence estimation for convolutionally coded signals with binary digital modulation in ISI channels

✍ Fuqin Xiong 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 752 KB

Decoding convolutional codes with binary digital modulation in intersymbol inter-Jerence (ISI) channels is studied. The receiver structure is a whitened matched filter (WMF) whose transi[br function is determined by the ISI channel. Decoding t~f the output sequence can be per/brined in two steps or