Matched Metrics And Channels

dc.creatorFirer
dc.creatorM; Walker
dc.creatorJL
dc.date2016
dc.date2016-12-06T18:31:07Z
dc.date2016-12-06T18:31:07Z
dc.date.accessioned2018-03-29T02:03:44Z
dc.date.available2018-03-29T02:03:44Z
dc.identifier1557-9654
dc.identifierIeee Transactions On Information Theory. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, n. 62, n. 3, p. 1150 - 1156.
dc.identifier0018-9448
dc.identifierWOS:000370954900005
dc.identifier10.1109/TIT.2015.2512596
dc.identifierhttp://ieeexplore.ieee.org.ez88.periodicos.capes.gov.br/document/7366596/
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/320214
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1310980
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionThe most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well known that maximum likelihood decoding coincides with nearest neighbor decoding with respect to the Hamming metric on the binary symmetric channel. In this paper, we study channels and metrics for which those two criteria do and do not coincide for general codes.
dc.description62
dc.description
dc.description1150
dc.description1156
dc.descriptionSao Paulo Research Foundation [2013/25977-7]
dc.descriptionNational Science Foundation [DMS-0903517]
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description
dc.description
dc.description
dc.languageEnglish
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.publisherPISCATAWAY
dc.relationIEEE Transactions On Information Theory
dc.rightsfechado
dc.sourceWOS
dc.subjectBinary Codes
dc.subjectChannel Models
dc.subjectMaximum Likelihood Decoding
dc.subjectNearest Neighbor Decoding
dc.titleMatched Metrics And Channels
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución