The Metric Structure of Codes for the Binary Symmetric Channel

reportActive / Technical Report | Accession Number: AD1027779 | Open PDF

Abstract:

The main result of this paper, theorem 4, is that there exists an infinite sequence of binary digits which can be used to generate sliding parity check codes for the binary symmetric channel BSC, and the error probability for such codes is close, in a certain sense, to minimum uniformly in all of the parameters block length, probability of error for a single digit, and rate not too much less than capacity. This result is obtained by studying the metric structure which can be required of codes, and then relating this to the error probability. The paper is essentially self-contained.

Author(s):
Thomasian, A J
Author Organization(s):
UNIVERSITY OF CALIFORNIA, BERKELEY BERKELEY United States
Descriptive Note:
Conference Paper
Supplementary Note:
Fourth Berkeley Symposium on Mathematical Statistics and Probability -Volume 1: , 20 Jun 1960, 30 Jul 1960,
Pagination:
0012

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release
Distribution Statement:
Approved For Public Release;

RECORD

Collection: TR
Identifying Numbers
Contract/Grant Number(s):
Nonr-222(53)
 Subject Terms
Joint Capability Areas:
JCA_1_Force Support; JCA_5_Command and Control; JCA_1.2_Force Preparation; JCA_1.2.3_Educating; JCA_3.2_Engagement; JCA_3_Force Application
Modernization Areas:
Fully Networked C3
Communities of Interest:
C4I
Descriptor(s):
probability, random variables, channel capacity, intervals, sequences, Binary arithmetic
Keyword(s):
bsc(binary symmetric channel)
Report Date:
1960 Jan 01
Creation Date:
2017 May 08