Academic Journal
Matched Metrics and Channels.
| العنوان: | Matched Metrics and Channels. |
|---|---|
| المؤلفون: | Firer, Marcelo1, Walker, Judy L.2 |
| المصدر: | IEEE Transactions on Information Theory. Mar2016, Vol. 62 Issue 3, p1150-1156. 7p. |
| مصطلحات موضوعية: | MAXIMUM likelihood decoding, EUCLIDEAN distance, CHANNEL coding, BINARY codes, NEAREST neighbor analysis (Statistics) |
| مستخلص: | The 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. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| قاعدة البيانات: | Business Source Index |
| ResultId |
1 |
|---|---|
| Header |
bsx Business Source Index 113114890 1216 6 Academic Journal academicJournal 1216.49609375 |
| PLink |
https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=bsx&AN=113114890&custid=s6537998&authtype=sso |
| FullText |
Array
(
[Availability] => 0
)
|
| Items |
Array
(
[Name] => Title
[Label] => Title
[Group] => Ti
[Data] => Matched Metrics and Channels.
)
Array ( [Name] => Author [Label] => Authors [Group] => Au [Data] => <searchLink fieldCode="AR" term="%22Firer%2C+Marcelo%22">Firer, Marcelo</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Walker%2C+Judy+L%2E%22">Walker, Judy L.</searchLink><relatesTo>2</relatesTo> ) Array ( [Name] => TitleSource [Label] => Source [Group] => Src [Data] => <searchLink fieldCode="JN" term="%22IEEE+Transactions+on+Information+Theory%22">IEEE Transactions on Information Theory</searchLink>. Mar2016, Vol. 62 Issue 3, p1150-1156. 7p. ) Array ( [Name] => Subject [Label] => Subject Terms [Group] => Su [Data] => <searchLink fieldCode="DE" term="%22MAXIMUM+likelihood+decoding%22">MAXIMUM likelihood decoding</searchLink><br /><searchLink fieldCode="DE" term="%22EUCLIDEAN+distance%22">EUCLIDEAN distance</searchLink><br /><searchLink fieldCode="DE" term="%22CHANNEL+coding%22">CHANNEL coding</searchLink><br /><searchLink fieldCode="DE" term="%22BINARY+codes%22">BINARY codes</searchLink><br /><searchLink fieldCode="DE" term="%22NEAREST+neighbor+analysis+%28Statistics%29%22">NEAREST neighbor analysis (Statistics)</searchLink> ) Array ( [Name] => Abstract [Label] => Abstract [Group] => Ab [Data] => The 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. [ABSTRACT FROM AUTHOR] ) Array ( [Name] => AbstractSuppliedCopyright [Label] => [Group] => Ab [Data] => <i>Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) ) |
| RecordInfo |
Array
(
[BibEntity] => Array
(
[Identifiers] => Array
(
[0] => Array
(
[Type] => doi
[Value] => 10.1109/TIT.2015.2512596
)
)
[Languages] => Array
(
[0] => Array
(
[Code] => eng
[Text] => English
)
)
[PhysicalDescription] => Array
(
[Pagination] => Array
(
[PageCount] => 7
[StartPage] => 1150
)
)
[Subjects] => Array
(
[0] => Array
(
[SubjectFull] => MAXIMUM likelihood decoding
[Type] => general
)
[1] => Array
(
[SubjectFull] => EUCLIDEAN distance
[Type] => general
)
[2] => Array
(
[SubjectFull] => CHANNEL coding
[Type] => general
)
[3] => Array
(
[SubjectFull] => BINARY codes
[Type] => general
)
[4] => Array
(
[SubjectFull] => NEAREST neighbor analysis (Statistics)
[Type] => general
)
)
[Titles] => Array
(
[0] => Array
(
[TitleFull] => Matched Metrics and Channels.
[Type] => main
)
)
)
[BibRelationships] => Array
(
[HasContributorRelationships] => Array
(
[0] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Firer, Marcelo
)
)
)
[1] => Array
(
[PersonEntity] => Array
(
[Name] => Array
(
[NameFull] => Walker, Judy L.
)
)
)
)
[IsPartOfRelationships] => Array
(
[0] => Array
(
[BibEntity] => Array
(
[Dates] => Array
(
[0] => Array
(
[D] => 01
[M] => 03
[Text] => Mar2016
[Type] => published
[Y] => 2016
)
)
[Identifiers] => Array
(
[0] => Array
(
[Type] => issn-print
[Value] => 00189448
)
)
[Numbering] => Array
(
[0] => Array
(
[Type] => volume
[Value] => 62
)
[1] => Array
(
[Type] => issue
[Value] => 3
)
)
[Titles] => Array
(
[0] => Array
(
[TitleFull] => IEEE Transactions on Information Theory
[Type] => main
)
)
)
)
)
)
)
|
| IllustrationInfo |