Size of 1-error-detecting codes in three interactive transmissions

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper considers the error-detecting codes between two nodes. There are three transmissions between these two nodes: node A and node B. The first transmission can transmit one symbol within the alphabet {0, 1.,, q1-1} from node A to node B; the second transmission can transmit one symbol within the alphabet {0, 1.,, q2-1} from node B to node A; and the third transmission can transmit one symbol within the alphabet {0, 1.,, q3-1} from node A to node B. One of the three transmissions may be erroneous. We prove that the maximum size of all 1-error-detecting codes over these three transmissions is min{q1, q2(q3-1)}.

Original languageEnglish
Title of host publication2015 IEEE 81st Vehicular Technology Conference, VTC Spring 2015 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479980888
DOIs
StatePublished - 1 Jul 2015
Externally publishedYes
Event81st IEEE Vehicular Technology Conference, VTC Spring 2015 - Glasgow, United Kingdom
Duration: 11 May 201514 May 2015

Publication series

NameIEEE Vehicular Technology Conference
Volume2015
ISSN (Print)1550-2252

Conference

Conference81st IEEE Vehicular Technology Conference, VTC Spring 2015
Country/TerritoryUnited Kingdom
CityGlasgow
Period11/05/1514/05/15

Fingerprint

Dive into the research topics of 'Size of 1-error-detecting codes in three interactive transmissions'. Together they form a unique fingerprint.

Cite this