An Optimal Coding Scheme for a Certain Type of Ensemble

Benjamin Arazi

doi:10.1109/TCOM.1975.1092883

An Optimal Coding Scheme for a Certain Type of Ensemble

Benjamin Arazi

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

An optimal coding scheme is offered for binary messages with a limited number of successive runs of length 1 (i.e., strings of the form 010101 •••, in the messages, have a known limited length). A practical example is given of a case where such messages are found.

Original language	English
Pages (from-to)	741-743
Number of pages	3
Journal	IEEE Transactions on Communications
Volume	23
Issue number	7
DOIs	https://doi.org/10.1109/TCOM.1975.1092883
State	Published - 1 Jan 1975
Externally published	Yes

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/TCOM.1975.1092883

Cite this

@article{c3b64af1c6e54ba5990d157cb1c9b012,

title = "An Optimal Coding Scheme for a Certain Type of Ensemble",

abstract = "An optimal coding scheme is offered for binary messages with a limited number of successive runs of length 1 (i.e., strings of the form 010101 •••, in the messages, have a known limited length). A practical example is given of a case where such messages are found.",

author = "Benjamin Arazi",

year = "1975",

month = jan,

day = "1",

doi = "10.1109/TCOM.1975.1092883",

language = "English",

volume = "23",

pages = "741--743",

journal = "IEEE Transactions on Communications",

issn = "0090-6778",

publisher = "Institute of Electrical and Electronics Engineers",

number = "7",

}

TY - JOUR

T1 - An Optimal Coding Scheme for a Certain Type of Ensemble

AU - Arazi, Benjamin

PY - 1975/1/1

Y1 - 1975/1/1

N2 - An optimal coding scheme is offered for binary messages with a limited number of successive runs of length 1 (i.e., strings of the form 010101 •••, in the messages, have a known limited length). A practical example is given of a case where such messages are found.

AB - An optimal coding scheme is offered for binary messages with a limited number of successive runs of length 1 (i.e., strings of the form 010101 •••, in the messages, have a known limited length). A practical example is given of a case where such messages are found.

UR - https://www.scopus.com/pages/publications/0016534178

U2 - 10.1109/TCOM.1975.1092883

DO - 10.1109/TCOM.1975.1092883

M3 - Article

AN - SCOPUS:0016534178

SN - 0090-6778

VL - 23

SP - 741

EP - 743

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 7

ER -

An Optimal Coding Scheme for a Certain Type of Ensemble

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this