Zobraziť v EDS

On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem.

Uložené v:
Podrobná bibliografia
Názov: On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem.
Autori: Davydov, V. A.
Zdroj: Problems of Information Transmission; Apr2019, Vol. 55 Issue 2, p145-151, 7p
Predmety: MEMORYLESS systems, EUCLIDEAN metric, BINARY codes, GEOMETRIC quantization, PROBLEM solving
Abstrakt: We prove equivalence of using the modulus metric and Euclidean metric in solving the soft decoding problem for a memoryless discrete channel with binary input and Q-ary output. For such a channel, we give an example of a construction of binary codes correcting t binary errors in the Hamming metric. The constructed codes correct errors at the output of a demodulator with Q quantization errors as (t + 1)(Q − 1) − 1 errors in the modulus metric. The obtained codes are shown to have polynomial decoding complexity. [ABSTRACT FROM AUTHOR]
Copyright of Problems of Information Transmission is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. 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.)
Databáza: Complementary Index
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edb&genre=article&issn=00329460&ISBN=&volume=55&issue=2&date=20190401&spage=145&pages=145-151&title=Problems of Information Transmission&atitle=On%20Application%20of%20the%20Modulus%20Metric%20to%20Solving%20the%20Minimum%20Euclidean%20Distance%20Decoding%20Problem.&aulast=Davydov%2C%20V.%20A.&id=DOI:10.1134/S0032946019020030
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Davydov%20VA
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edb
DbLabel: Complementary Index
An: 137453435
RelevancyScore: 886
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 885.537719726563
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Davydov%2C+V%2E+A%2E%22">Davydov, V. A.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Problems of Information Transmission; Apr2019, Vol. 55 Issue 2, p145-151, 7p
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22MEMORYLESS+systems%22">MEMORYLESS systems</searchLink><br /><searchLink fieldCode="DE" term="%22EUCLIDEAN+metric%22">EUCLIDEAN metric</searchLink><br /><searchLink fieldCode="DE" term="%22BINARY+codes%22">BINARY codes</searchLink><br /><searchLink fieldCode="DE" term="%22GEOMETRIC+quantization%22">GEOMETRIC quantization</searchLink><br /><searchLink fieldCode="DE" term="%22PROBLEM+solving%22">PROBLEM solving</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We prove equivalence of using the modulus metric and Euclidean metric in solving the soft decoding problem for a memoryless discrete channel with binary input and Q-ary output. For such a channel, we give an example of a construction of binary codes correcting t binary errors in the Hamming metric. The constructed codes correct errors at the output of a demodulator with Q quantization errors as (t + 1)(Q − 1) − 1 errors in the modulus metric. The obtained codes are shown to have polynomial decoding complexity. [ABSTRACT FROM AUTHOR]
– Name: Abstract
  Label:
  Group: Ab
  Data: <i>Copyright of Problems of Information Transmission is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. 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.)
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edb&AN=137453435
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1134/S0032946019020030
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 7
        StartPage: 145
    Subjects:
      – SubjectFull: MEMORYLESS systems
        Type: general
      – SubjectFull: EUCLIDEAN metric
        Type: general
      – SubjectFull: BINARY codes
        Type: general
      – SubjectFull: GEOMETRIC quantization
        Type: general
      – SubjectFull: PROBLEM solving
        Type: general
    Titles:
      – TitleFull: On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Davydov, V. A.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2019
              Type: published
              Y: 2019
          Identifiers:
            – Type: issn-print
              Value: 00329460
          Numbering:
            – Type: volume
              Value: 55
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Problems of Information Transmission
              Type: main
ResultId 1