On Linear Coding over Finite Rings and Applications to Computing
This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian–Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37–46) and Csiszár (IEEE Trans. Inf. Theory 1982, 28, 585–592) for linear cod...
Uložené v:
| Vydané v: | Entropy (Basel, Switzerland) Ročník 19; číslo 5; s. 233 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Basel
MDPI AG
20.05.2017
|
| Predmet: | |
| ISSN: | 1099-4300, 1099-4300 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian–Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37–46) and Csiszár (IEEE Trans. Inf. Theory 1982, 28, 585–592) for linear coding over finite fields as special cases. In addition, it is shown that, for any set of finite correlated discrete memoryless sources, there always exists a sequence of linear encoders over some finite non-field rings which achieves the data compression limit, the Slepian–Wolf region. Hence, the optimality problem regarding linear coding over finite non-field rings for data compression is closed with positive confirmation with respect to existence. For application, we address the problem of source coding for computing, where the decoder is interested in recovering a discrete function of the data generated and independently encoded by several correlated i.i.d. random sources. We propose linear coding over finite rings as an alternative solution to this problem. Results in Körner–Marton (IEEE Trans. Inf. Theory 1979, 25, 219–221) and Ahlswede–Han (IEEE Trans. Inf. Theory 1983, 29, 396–411, Theorem 10) are generalized to cases for encoding (pseudo) nomographic functions (over rings). Since a discrete function with a finite domain always admits a nomographic presentation, we conclude that both generalizations universally apply for encoding all discrete functions of finite domains. Based on these, we demonstrate that linear coding over finite rings strictly outperforms its field counterpart in terms of achieving better coding rates and reducing the required alphabet sizes of the encoders for encoding infinitely many discrete functions. |
|---|---|
| AbstractList | This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian-Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37-46) and Csiszár (IEEE Trans. Inf. Theory 1982, 28, 585-592) for linear coding over finite fields as special cases. In addition, it is shown that, for any set of finite correlated discrete memoryless sources, there always exists a sequence of linear encoders over some finite non-field rings which achieves the data compression limit, the Slepian-Wolf region. Hence, the optimality problem regarding linear coding over finite non-field rings for data compression is closed with positive confirmation with respect to existence. For application, we address the problem of source coding for computing, where the decoder is interested in recovering a discrete function of the data generated and independently encoded by several correlated i.i.d. random sources. We propose linear coding over finite rings as an alternative solution to this problem. Results in Körner-Marton (IEEE Trans. Inf. Theory 1979, 25, 219-221) and Ahlswede-Han (IEEE Trans. Inf. Theory 1983, 29, 396-411, Theorem 10) are generalized to cases for encoding (pseudo) nomographic functions (over rings). Since a discrete function with a finite domain always admits a nomographic presentation, we conclude that both generalizations universally apply for encoding all discrete functions of finite domains. Based on these, we demonstrate that linear coding over finite rings strictly outperforms its field counterpart in terms of achieving better coding rates and reducing the required alphabet sizes of the encoders for encoding infinitely many discrete functions. |
| Author | Huang, Sheng Skoglund, Mikael |
| Author_xml | – sequence: 1 givenname: Sheng surname: Huang fullname: Huang, Sheng – sequence: 2 givenname: Mikael surname: Skoglund fullname: Skoglund, Mikael |
| BackLink | https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-216497$$DView record from Swedish Publication Index (Kungliga Tekniska Högskolan) |
| BookMark | eNptkUtLAzEQgIMoWB8H_8GCJw-rmexuurlZ6hMKBVGvIZtHTW2TNUkV_72xFVHxlGHmyzfMzB7adt5phI4An1YVw2caGG4wqaotNADMWFlXGG__iHfRXoxznBECdIDOp66YWKdFKMZeWTcr_KsOxZV1NuniLidiIZwqRn2_sFIk610sks_wsl-lXD5AO0Ysoj78evfRw9Xl_fimnEyvb8ejSSlrSlKpOiVqCTUIQw0wQkCRWimiTNdUUmGJgWLRQTcEoJIa0ygDuiOUGEwbgat9dLvxKi_mvA92KcI798LydcKHGRchWbnQfCg1EwK3VUtk7iFbRRnpgDRtbqfbNrvKjSu-6X7V_bJd2MfR2vacnnheUc2GmT_e8H3wLysdE5_7VXB5XA4McNOyZvhpPdlQMvgYgzbfXsD88zj8-ziZPfvDSpvW201B2MU_Pz4ATl6RRA |
| CitedBy_id | crossref_primary_10_3390_e21050457 crossref_primary_10_1109_TIT_2020_3002756 |
| Cites_doi | 10.1109/18.165454 10.1214/aoms/1177693508 10.1109/Swe-CTW.2012.6376282 10.1002/j.1538-7305.1968.tb02486.x 10.1109/TIT.2009.2015992 10.1109/ISIT.2012.6284664 10.1109/ISIT.2013.6620573 10.1007/978-1-4612-6101-8 10.1109/TIT.1982.1056524 10.1007/978-1-4612-4418-9 10.1109/ISIT.2007.4557448 10.1109/TIT.1983.1056669 10.1109/TIT.1979.1056022 10.1007/BF01950276 10.2307/2312421 10.1109/18.508859 10.1109/TIT.1987.1057272 10.1109/TIT.2010.2103852 10.1090/S0002-9939-1982-0652441-4 10.1007/978-1-4419-8616-0 10.1109/TIT.2010.2054330 10.1002/047174882X 10.1109/ISIT.2014.6875313 10.1109/TIT.1973.1055037 10.1017/CBO9780511525926 10.1090/gsm/114 |
| ContentType | Journal Article |
| Copyright | Copyright MDPI AG 2017 |
| Copyright_xml | – notice: Copyright MDPI AG 2017 |
| DBID | AAYXX CITATION 7TB 8FD 8FE 8FG ABJCF ABUWG AFKRA AZQEC BENPR BGLVJ CCPQU DWQXO FR3 HCIFZ KR7 L6V M7S PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS ADTPV AOWAS D8V DOA |
| DOI | 10.3390/e19050233 |
| DatabaseName | CrossRef Mechanical & Transportation Engineering Abstracts Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection (ProQuest) ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Engineering Research Database SciTech Premium Collection Civil Engineering Abstracts ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection (ProQuest) SwePub SwePub Articles SWEPUB Kungliga Tekniska Högskolan DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central Essentials ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Civil Engineering Abstracts Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: DOA name: Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: ProQuest Publicly Available Content url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 1099-4300 |
| ExternalDocumentID | oai_doaj_org_article_7ce9aa08382c4ddc8d692b12582dfe88 oai_DiVA_org_kth_216497 10_3390_e19050233 |
| GroupedDBID | 29G 2WC 5GY 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABJCF ACIWK ACUHS ADBBV AEGXH AENEX AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS BCNDV BENPR BGLVJ CCPQU CITATION CS3 DU5 E3Z ESX F5P GROUPED_DOAJ GX1 HCIFZ HH5 J9A KQ8 L6V M7S MODMG M~E OK1 OVT PHGZM PHGZT PIMPY PQGLB PROAC PTHSS RNS TR2 TUS XSB ~8M 7TB 8FD ABUWG AZQEC DWQXO FR3 KR7 PKEHL PQEST PQQKQ PQUKI PRINS ADTPV AOWAS C1A CH8 D8V IAO IPNFZ ITC PGMZT RIG RPM |
| ID | FETCH-LOGICAL-c462t-dbda4c141af6f19221d24dd2dfb53cd0c0160ab1b7116c6ff5df1eb262f065a03 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000404453700050&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1099-4300 |
| IngestDate | Tue Oct 14 19:08:56 EDT 2025 Tue Nov 04 17:18:37 EST 2025 Fri Jul 25 11:49:05 EDT 2025 Sat Nov 29 07:17:31 EST 2025 Tue Nov 18 22:10:27 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c462t-dbda4c141af6f19221d24dd2dfb53cd0c0160ab1b7116c6ff5df1eb262f065a03 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://doaj.org/article/7ce9aa08382c4ddc8d692b12582dfe88 |
| PQID | 1910589578 |
| PQPubID | 2032401 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_7ce9aa08382c4ddc8d692b12582dfe88 swepub_primary_oai_DiVA_org_kth_216497 proquest_journals_1910589578 crossref_primary_10_3390_e19050233 crossref_citationtrail_10_3390_e19050233 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-05-20 |
| PublicationDateYYYYMMDD | 2017-05-20 |
| PublicationDate_xml | – month: 05 year: 2017 text: 2017-05-20 day: 20 |
| PublicationDecade | 2010 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Entropy (Basel, Switzerland) |
| PublicationYear | 2017 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Como (ref_10) 2010; 56 Interlando (ref_29) 1996; 42 Krithivasan (ref_11) 2011; 57 Slepian (ref_1) 1973; 19 Marton (ref_4) 1979; 25 ref_14 ref_12 Forney (ref_26) 1992; 38 ref_31 ref_30 ref_19 Han (ref_8) 1987; 33 ref_18 ref_17 ref_16 ref_15 Ahlswede (ref_5) 1983; 29 Elias (ref_2) 1955; 3 Buck (ref_22) 1982; 85 (ref_3) 1982; 28 ref_23 ref_21 Ahlswede (ref_25) 1971; 42 ref_20 Slepian (ref_24) 1968; 47 Mullen (ref_13) 1984; 44 ref_28 Singmaster (ref_27) 1964; 71 Como (ref_9) 2009; 55 ref_7 ref_6 |
| References_xml | – volume: 38 start-page: 1797 year: 1992 ident: ref_26 article-title: On the Hamming distance properties of group codes publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.165454 – ident: ref_30 – volume: 42 start-page: 224 year: 1971 ident: ref_25 article-title: Group Codes do not Achieve Shannon’s Channel Capacity for General Discrete Channels publication-title: Ann. Math. Stat. doi: 10.1214/aoms/1177693508 – ident: ref_23 doi: 10.1109/Swe-CTW.2012.6376282 – volume: 47 start-page: 575 year: 1968 ident: ref_24 article-title: Group Codes for the Gaussian Channel publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1968.tb02486.x – volume: 55 start-page: 2037 year: 2009 ident: ref_9 article-title: The Capacity of Finite Abelian Group Codes over Symmetric Memoryless Channels publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2009.2015992 – ident: ref_7 doi: 10.1109/ISIT.2012.6284664 – ident: ref_20 doi: 10.1109/ISIT.2013.6620573 – ident: ref_14 doi: 10.1007/978-1-4612-6101-8 – volume: 28 start-page: 585 year: 1982 ident: ref_3 article-title: Linear Codes for Sources and Source Networks: Error Exponents, Universal Coding publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1982.1056524 – ident: ref_17 doi: 10.1007/978-1-4612-4418-9 – ident: ref_16 – ident: ref_28 doi: 10.1109/ISIT.2007.4557448 – volume: 29 start-page: 396 year: 1983 ident: ref_5 article-title: On Source Coding with Side Information via a Multiple-Access Channel and Related Problems in Multi-User Information Theory publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1983.1056669 – volume: 25 start-page: 219 year: 1979 ident: ref_4 article-title: How to Encode The Modulo-Two Sum of Binary Sources publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1979.1056022 – ident: ref_18 – volume: 44 start-page: 237 year: 1984 ident: ref_13 article-title: Polynomial functions (modm) publication-title: Acta Math. Hung. doi: 10.1007/BF01950276 – volume: 71 start-page: 918 year: 1964 ident: ref_27 article-title: Rings of Order Four publication-title: Math. Assoc. Am. doi: 10.2307/2312421 – volume: 42 start-page: 1277 year: 1996 ident: ref_29 article-title: Group Block Codes Over Nonabelian Groups are Asymptotically Bad publication-title: IEEE Trans. Inf. Theory doi: 10.1109/18.508859 – volume: 33 start-page: 69 year: 1987 ident: ref_8 article-title: A Dichotomy of Functions F(X, Y) of Correlated Sources (X, Y) from the Viewpoint of the Achievable Rate Region publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1987.1057272 – volume: 57 start-page: 1495 year: 2011 ident: ref_11 article-title: Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2010.2103852 – volume: 85 start-page: 195 year: 1982 ident: ref_22 article-title: Nomographic Functions are Nowhere Dense publication-title: Proc. Am. Math. Soc. doi: 10.1090/S0002-9939-1982-0652441-4 – ident: ref_15 doi: 10.1007/978-1-4419-8616-0 – ident: ref_6 doi: 10.1109/ISIT.2012.6284664 – volume: 56 start-page: 4321 year: 2010 ident: ref_10 article-title: Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2010.2054330 – ident: ref_19 doi: 10.1002/047174882X – ident: ref_21 doi: 10.1109/ISIT.2014.6875313 – volume: 19 start-page: 471 year: 1973 ident: ref_1 article-title: Noiseless Coding of Correlated Information Sources publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.1973.1055037 – volume: 3 start-page: 37 year: 1955 ident: ref_2 article-title: Coding for Noisy Channels publication-title: IRE Conv. Rec. – ident: ref_31 doi: 10.1017/CBO9780511525926 – ident: ref_12 doi: 10.1090/gsm/114 |
| SSID | ssj0023216 |
| Score | 2.1091402 |
| Snippet | This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian–Wolf source coding problem. This theorem covers... This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian-Wolf source coding problem. This theorem covers... |
| SourceID | doaj swepub proquest crossref |
| SourceType | Open Website Open Access Repository Aggregation Database Enrichment Source Index Database |
| StartPage | 233 |
| SubjectTerms | Coders Codes Coding Correlation Data compression Discrete functions Field Linear coding Mathematical analysis Optimization Recovering Ring Source coding Source coding for computing Theorems |
| SummonAdditionalLinks | – databaseName: Engineering Database dbid: M7S link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELagMLDwECAKBVkIIZao9SOJM0EpVAyoIB5Vt8jxAypQUtrA7-ecpKWVEAurY8XO3flevnyH0AlIjZXMhp4xkYEARUpPWGE85f5iJDzktige79-GvZ4YDKL7KuE2qcoqpzqxUNQ6Uy5H3oS4wnXAAwE7H314rmuUu12tWmgsoxWHkkCK0r3HWcDFKAlKNCEGoX3TgPHzYZQt2KACqn_Rv5zHDC3sTHfjvzvcROuVh4nbpUhsoSWTbqOLuxRD2AlijTuZM1fYlW7i7tC5nPjBpcuxTDVuz91n4zzDZdMHeLyDnrvXT50br2qeAGQOaO7pREuuCCfSBhbcOEo05VpTbROfKd1SDlpOJiQJCQlUYK2vLYEwO6AWvBLZYruolmap2UOYm4BSzaSkXHFtqbCG8TBpMapMCCq1js6m5IxVhSzuGly8xxBhOMrHM8rX0fFs6qiE0_ht0qXjyWyCQ8AuBrLxS1wdqDhUJpISHEhBYVNaCR1ENAF3TcAnGiHqqDHlUlwdy0n8w6I6Oi25vLDK1bDfLlZ5y19jEB4ehft_v-cArVFn6Fs-6JsGquXjT3OIVtVXPpyMjwpx_AZHN-m8 priority: 102 providerName: ProQuest |
| Title | On Linear Coding over Finite Rings and Applications to Computing |
| URI | https://www.proquest.com/docview/1910589578 https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-216497 https://doaj.org/article/7ce9aa08382c4ddc8d692b12582dfe88 |
| Volume | 19 |
| WOSCitedRecordID | wos000404453700050&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: Directory of Open Access Journals customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: DOA dateStart: 20160101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: M~E dateStart: 19990101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: M7S dateStart: 19990301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: BENPR dateStart: 19990301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Publicly Available Content customDbUrl: eissn: 1099-4300 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023216 issn: 1099-4300 databaseCode: PIMPY dateStart: 19990301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFA8yPXgRRcXpHEFEvJQ1H2vam9vcUNA5po55Kmk-cCidbNWjf7svbTc2ELx46SF5kOS9NO_92pffQ-gcdo2VzArPmMgAQJHSC21oPOVuMRIuuM2Tx0d3ot8Px-NosFLqy-WEFfTAheIaQplISggUQqq41irUQUQTcMsh1daE-TVfX0QLMFVCLUZJUPAIMQD1DQNurwmtbM375CT965HlKlto7mF6u2inDA1xq5jSHtow6T66ekgx4EXYj7gzdX4Gu5xL3Ju4WBEP3XduLFONWys_onE2xUW1Bug-QM-97lPnxiurHoB-App5OtGSK8KJtIGF-IsSTWHhsNqkyZT2leOEkwlJBCGBCqxtaksAHwfUQjghfXaIKuk0NUcIcxNQqpmUlIPuLA2tYVwkPqPKCDgLq-hyoY1YlZTgrjLFewzQwCkuXiquis6Woh8FD8ZvQm2n0qWAo67OG8CgcWnQ-C-DVlFtYZC4fJ_mMaBKV_8QjpcquiiMtDbK9WTUykd5y15jsD2PxPF_TOYEbVPnx_0mHCc1VMlmn-YUbamvbDKf1dFmu9sfDOv53qu7tNFH9_zuQs_g9n7w8gOKguGR |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VUoleeKhFLBSwEK24RI0fmzgHVJaWVasu24qWqjfj-FFWoKTsBir-FL-RcR5LV0LceuDqWLaT-TLzjT2eAXiJqPGa-zRyLnPooGgdSS9dZMItRipS4evg8bNROh7L8_PseAl-dXdhQlhlpxNrRW1LE_bIt9GvCBXwEGA7l9-iUDUqnK52JTQaWBy6n1foss1eH-yhfDcZG7473d2P2qoCOH_CqsjmVgtDBdU-8chvGLVMWMusz_vc2NiEnGs6p3lKaWIS7_vWU_Q_E-bRXOuY47i34DbSCJbVoYIncwePM5o02Ys4z-Jth8a2j618webVpQEW-ez1HKW1XRve-9--yH242zJoMmgg_wCWXLEGb44Kgm41robslsEckxCaSoaTQKnJh3AcQHRhyeDaeT2pStIUtcDH6_DxRhb9EJaLsnCPgAiXMGa51kwYYT2T3nGR5jFnxqVoMnrwqhOfMm3m9FDA46tCDypIWs0l3YMX866XTbqQv3V6GzAw7xAyfNcN5fRCtQpDpcZlWiNBlgwXZY20ScZypKMSX9FJ2YONDhWqVTsz9QcSPdhqULUwy97kbFDP8qX6rBCsIksf_3uc53Bn__T9SI0OxodPYJUFUhP3UbduwHI1_e6ewor5UU1m02f1r0Dg000j7TfWA0if |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LbxMxEB6VFKFeeAhQAwUsBIjLKutHdr2HCkJDRNQSIgRVORmvHxCBdkuyBfHX-HWM9xEaCXHrgavXsr07n2e-WY9nAB4harzmPo2cyxw6KFpH0ksXmXCLkYpU-Dp4_Pgonc3kyUk234Jf3V2YEFbZ6cRaUdvShH_kA_QrQgU8BNjAt2ER8_Hk2em3KFSQCietXTmNBiKH7ucPdN9W-9MxyvoxY5OX7w5eRW2FAVxLwqrI5lYLQwXVPvHIdRi1TFjLrM-H3NjYhPxrOqd5SmliEu-H1lP0RRPm0XTrmOO4l2AbKblgPdieT1_PP6zdPc5o0uQy4jyLBw5N7xBb-YYFrAsFbLLb8xlLays3ufY_f5_rcLXl1mTUbIYbsOWKm_D8TUHQ4cbVkIMyGGoSglbJZBHINnkbDgqILiwZnTvJJ1VJmnIX-PgWvL-QRd-GXlEWbheIcAljlmvNhBHWM-kdF2kec2ZcisakD087USrT5lQPpT2-KvStgtTVWup9eLjuetokEvlbpxcBD-sOIfd33VAuP6lWlajUuExrpM6S4aKskTbJWI5EVeIrOin7sNchRLUKaaX-wKMPTxqEbcwyXhyP6lm-VJ8VAldk6Z1_j_MAriDA1NF0dngXdlhgO_EQle4e9KrlmbsHl833arFa3m_3BYGPFw21331UUtU |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+Linear+Coding+over+Finite+Rings+and+Applications+to+Computing&rft.jtitle=Entropy+%28Basel%2C+Switzerland%29&rft.au=Sheng+Huang&rft.au=Mikael+Skoglund&rft.date=2017-05-20&rft.pub=MDPI+AG&rft.eissn=1099-4300&rft.volume=19&rft.issue=5&rft.spage=233&rft_id=info:doi/10.3390%2Fe19050233&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_7ce9aa08382c4ddc8d692b12582dfe88 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1099-4300&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1099-4300&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1099-4300&client=summon |