Analysis and Research on Secondary LT Coding Anti-Eavesdropping Scheme Based on LT Code Degree-1
Fountain code can significantly increase eavesdroppers’ untranslated efficiency in the wireless communication eavesdropping channel. The secondary LT coding anti-eavesdropping scheme with fountain code degree-1 is the subject of a theoretical investigation in this paper. The fact that its channel se...
Saved in:
| Published in | Applied sciences Vol. 13; no. 20; p. 11296 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Basel
MDPI AG
01.10.2023
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2076-3417 2076-3417 |
| DOI | 10.3390/app132011296 |
Cover
| Abstract | Fountain code can significantly increase eavesdroppers’ untranslated efficiency in the wireless communication eavesdropping channel. The secondary LT coding anti-eavesdropping scheme with fountain code degree-1 is the subject of a theoretical investigation in this paper. The fact that its channel security capacity is greater than that of traditional LT code is first deduced from an information-theoretic standpoint, and the impact of source symbol length on decoding complexity and decoding overhead is then examined. The experimental results show that, compared with the traditional anti-eavesdropping twice fountain code, selecting long source symbols for double LT coding, when the main channel is better than the eavesdropping channel, can ensure that the eavesdropper has a higher untranslated efficiency, and can effectively reduce the fountain code decoding complexity and the number of encoded symbols sent by the source to improve the efficiency of information transmission. |
|---|---|
| AbstractList | Fountain code can significantly increase eavesdroppers’ untranslated efficiency in the wireless communication eavesdropping channel. The secondary LT coding anti-eavesdropping scheme with fountain code degree-1 is the subject of a theoretical investigation in this paper. The fact that its channel security capacity is greater than that of traditional LT code is first deduced from an information-theoretic standpoint, and the impact of source symbol length on decoding complexity and decoding overhead is then examined. The experimental results show that, compared with the traditional anti-eavesdropping twice fountain code, selecting long source symbols for double LT coding, when the main channel is better than the eavesdropping channel, can ensure that the eavesdropper has a higher untranslated efficiency, and can effectively reduce the fountain code decoding complexity and the number of encoded symbols sent by the source to improve the efficiency of information transmission. |
| Audience | Academic |
| Author | Niu, Fanglin Wang, Lizheng Yu, Ling Jin, Jingjing |
| Author_xml | – sequence: 1 givenname: Lizheng surname: Wang fullname: Wang, Lizheng – sequence: 2 givenname: Fanglin surname: Niu fullname: Niu, Fanglin – sequence: 3 givenname: Jingjing surname: Jin fullname: Jin, Jingjing – sequence: 4 givenname: Ling surname: Yu fullname: Yu, Ling |
| BookMark | eNptkV1LHDEUhkNRqFrv_AGB3nY0HzOTzOV2_aiwUKh6Hc8kZ9Ysu8mYjAX_fbOdIlJMLhJenvc9h3OOyUGIAQk54-xcyo5dwDhyKRjnoms_kSPBVFvJmquDd__P5DTnDSun41JzdkQeFwG2r9lnCsHRX5gRkn2iMdA7tDE4SK90dU-X0fmwposw-eoKfmN2KY7jXrqzT7hD-h0yur1thpFe4johVvwLORxgm_H033tCHq6v7pc_qtXPm9vlYlXZmrVT1dc91rblGjrUvWIc7dD0ztqm41pZ4NBa4RruhKoHAfVQ94BC9-CUgBYHeUJu51wXYWPG5HeldRPBm79CTGsDafJ2i6ZrWC90wxRXsraq0Q4001w4ZiUy2ZSsr3PWmOLzC-bJbOJLKoPKRmgtpFaqZYU6n6k1lFAfhjglsOU63PkyOxx80RdK8Y51s-HbbLAp5pxweGuTM7PfoXm_w4KL_3DrJ5h8DKWO335s-gNMT563 |
| CitedBy_id | crossref_primary_10_3390_s25020460 |
| Cites_doi | 10.1109/TCOMM.2020.2997400 10.1109/ACCESS.2022.3178811 10.1109/TCOMM.2022.3178764 10.1109/MCOM.2015.7295483 10.1109/LWC.2022.3147601 10.1002/j.1538-7305.1975.tb02040.x 10.1109/TIT.2009.2032814 10.1109/TII.2015.2509442 10.1109/TIT.2016.2570232 10.1109/TIT.2008.921678 10.1109/SURV.2012.020212.00049 10.1109/LCOMM.2016.2574355 10.1109/LCOMM.2019.2915670 10.3390/sym14102026 10.1109/INFCOM.2009.5062099 10.1007/s11276-016-1318-8 10.1049/cmu2.12503 10.1049/iet-com.2013.1033 10.1002/j.1538-7305.1949.tb00928.x |
| ContentType | Journal Article |
| Copyright | COPYRIGHT 2023 MDPI AG 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: COPYRIGHT 2023 MDPI AG – notice: 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION ABUWG AFKRA AZQEC BENPR CCPQU DWQXO PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS DOA |
| DOI | 10.3390/app132011296 |
| DatabaseName | CrossRef ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central (New) (NC LIVE) ProQuest One Community College ProQuest Central Korea 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 Academic ProQuest One Academic UKI Edition ProQuest Central China DOAJ Directory of Open Access Journals (Roanoke) |
| DatabaseTitle | CrossRef Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Publicly Available Content Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: BENPR name: ProQuest Central (subscription) url: http://www.proquest.com/pqcentral?accountid=15518 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| EISSN | 2076-3417 |
| ExternalDocumentID | oai_doaj_org_article_950b285071734c758da80812d0c3e035 A771909760 10_3390_app132011296 |
| GroupedDBID | .4S 2XV 5VS 7XC 8CJ 8FE 8FG 8FH AADQD AAFWJ AAYXX ADBBV ADMLS AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS APEBS ARCSS BCNDV BENPR CCPQU CITATION CZ9 D1I D1J D1K GROUPED_DOAJ IAO IGS ITC K6- K6V KC. KQ8 L6V LK5 LK8 M7R MODMG M~E OK1 P62 PHGZM PHGZT PIMPY PROAC TUS PMFND ABUWG AZQEC DWQXO PKEHL PQEST PQQKQ PQUKI PRINS PUEGO |
| ID | FETCH-LOGICAL-c406t-b4be4c618a9e8b701ecf5bdcc59187ca1a6c2d51d274f2a4f4bae28bad72a6ef3 |
| IEDL.DBID | 8FG |
| ISSN | 2076-3417 |
| IngestDate | Wed Aug 27 01:28:58 EDT 2025 Sun Jun 29 16:21:40 EDT 2025 Tue Jun 10 21:16:27 EDT 2025 Thu Apr 24 23:02:32 EDT 2025 Tue Jul 01 04:34:19 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 20 |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c406t-b4be4c618a9e8b701ecf5bdcc59187ca1a6c2d51d274f2a4f4bae28bad72a6ef3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://www.proquest.com/docview/2882387760?pq-origsite=%requestingapplication% |
| PQID | 2882387760 |
| PQPubID | 2032433 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_950b285071734c758da80812d0c3e035 proquest_journals_2882387760 gale_infotracacademiconefile_A771909760 crossref_primary_10_3390_app132011296 crossref_citationtrail_10_3390_app132011296 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2023-10-01 |
| PublicationDateYYYYMMDD | 2023-10-01 |
| PublicationDate_xml | – month: 10 year: 2023 text: 2023-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Applied sciences |
| PublicationYear | 2023 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Yi (ref_9) 2014; 8 Kasban (ref_12) 2022; 16 Liang (ref_3) 2008; 54 Zhang (ref_22) 2022; 10 Peng (ref_8) 2022; 11 Wyner (ref_2) 1975; 54 Kumar (ref_10) 2016; 20 ref_11 Cai (ref_19) 2019; 23 Liu (ref_14) 2022; 70 Bi (ref_6) 2015; 53 Hashemi (ref_18) 2016; 62 Jin (ref_23) 2021; 34 Shannon (ref_1) 1949; 28 Feng (ref_5) 2012; 15 Sarma (ref_7) 2018; 24 ref_16 ref_15 Zhang (ref_21) 2022; 2022 Ardestanizadeh (ref_4) 2009; 55 Sun (ref_13) 2015; 12 Huang (ref_20) 2020; 68 Sun (ref_17) 2014; 42 |
| References_xml | – volume: 42 start-page: 1918 year: 2014 ident: ref_17 article-title: A Novel Encoding Scheme for Regular Variable-Node Degree LT Codes publication-title: Acta Electron. Sin. – volume: 68 start-page: 5313 year: 2020 ident: ref_20 article-title: Design and analysis of online fountain codes for intermediate performance publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2020.2997400 – volume: 10 start-page: 57880 year: 2022 ident: ref_22 article-title: Design of Anti-Eavesdropping Scheme for SLT-LT Codes Based on Random Symbol Sets publication-title: IEEE Access doi: 10.1109/ACCESS.2022.3178811 – volume: 70 start-page: 4327 year: 2022 ident: ref_14 article-title: ROFC-LF: Recursive Online Fountain Code With Limited Feedback for Underwater Acoustic Networks publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2022.3178764 – volume: 53 start-page: 190 year: 2015 ident: ref_6 article-title: Wireless communications in the era of big data publication-title: IEEE Commun. Mag. doi: 10.1109/MCOM.2015.7295483 – volume: 11 start-page: 851 year: 2022 ident: ref_8 article-title: Opportunistic Fountain Coding with Coordinative Routing publication-title: IEEE Wirel. Commun. Lett. doi: 10.1109/LWC.2022.3147601 – volume: 54 start-page: 1355 year: 1975 ident: ref_2 article-title: The wire-tap channel publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1975.tb02040.x – volume: 55 start-page: 5353 year: 2009 ident: ref_4 article-title: Wiretap channel with secure rate-limited feedback publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2009.2032814 – volume: 12 start-page: 291 year: 2015 ident: ref_13 article-title: Fountain-coding aided strategy for secure cooperative transmission in industrial wireless sensor networks publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2015.2509442 – ident: ref_15 – volume: 62 start-page: 4054 year: 2016 ident: ref_18 article-title: Fountain codes with nonuniform selection distributions through feedback publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2016.2570232 – volume: 54 start-page: 2470 year: 2008 ident: ref_3 article-title: Secure communication over fading channels publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2008.921678 – volume: 15 start-page: 167 year: 2012 ident: ref_5 article-title: A survey of energy-efficient wireless communications publication-title: IEEE Commun. Surv. Tutor. doi: 10.1109/SURV.2012.020212.00049 – volume: 2022 start-page: 6106786 year: 2022 ident: ref_21 article-title: LT Codes with Double Encoding Matrix Reorder Physical Layer Secure Transmission publication-title: J. Sens. – volume: 20 start-page: 1491 year: 2016 ident: ref_10 article-title: Secure repairable fountain codes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2016.2574355 – volume: 23 start-page: 1136 year: 2019 ident: ref_19 article-title: Online fountain codes with unequal recovery time publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2019.2915670 – ident: ref_11 doi: 10.3390/sym14102026 – ident: ref_16 doi: 10.1109/INFCOM.2009.5062099 – volume: 34 start-page: 51 year: 2021 ident: ref_23 article-title: Design of secondary LT code information security Transmission based on the symbols of degree 1 publication-title: Chang. Inf. Commun. – volume: 24 start-page: 127 year: 2018 ident: ref_7 article-title: SNR based secure communication via untrusted amplify-and-forward relay nodes using artificial noise publication-title: Wirel. Netw. doi: 10.1007/s11276-016-1318-8 – volume: 16 start-page: 2479 year: 2022 ident: ref_12 article-title: Performance enhancing of MIMO-OFDM system utilizing different interleaving techniques with rate-less fountain raptor code publication-title: IET Commun. doi: 10.1049/cmu2.12503 – volume: 8 start-page: 2476 year: 2014 ident: ref_9 article-title: Achieving strong security based on fountain code with coset pre-coding publication-title: IET Commun. doi: 10.1049/iet-com.2013.1033 – volume: 28 start-page: 656 year: 1949 ident: ref_1 article-title: Communication theory of secrecy systems publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1949.tb00928.x |
| SSID | ssj0000913810 |
| Score | 2.2728963 |
| Snippet | Fountain code can significantly increase eavesdroppers’ untranslated efficiency in the wireless communication eavesdropping channel. The secondary LT coding... |
| SourceID | doaj proquest gale crossref |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database |
| StartPage | 11296 |
| SubjectTerms | Analysis anti-eavesdropping Codes delete channel eavesdropping channel Efficiency Electronic surveillance Energy consumption Information management Information theory LT code physical layer security Safety and security measures Signal to noise ratio Wireless communications Wireless networks |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals (Roanoke) dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA7iSQ_iE1dXyUFRkWAfSZscd30gol5U8BbzFEG7srsK_ntn2u6yHsSL13YK6cwk8w2Z-YaQvdx6D3HNMixRZDyNOZNKSFaoGCVX0tm6Xezmtrh84FeP4nFm1BfWhDX0wI3iTpRIbCZFfVvMHaBbb3BYROYTl4ckr9lLE5XMJFP1GaxSpK5qKt1zyOvxPhi7hRFeFD9iUE3V_9uBXEeZi2Wy1MJD2muWtULmQrVKFmdIA1fJSrsdR_Sw5Yw-WiNPE3IRaipPJ-V0dFDRO8x4vRl-0et7ejrAUEV71fiFnZvPMPLDARI0PNM7MN5boH0Iah4_a4QDPQuQkAeWrpOHi_P700vWDk9gDmL0mFluA3dFKo0K0pZJGlwU1jsnVCpLZ1JTuMyL1ENaGjPDI7cmZNIaX2amCDHfIPPVoAqbhEZrpLciU3A6ciGiBdjgAWjIaPFWT3bI8USd2rXM4jjg4lVDhoHK17PK75D9qfR7w6jxi1wfLTOVQR7s-gF4h269Q__lHR1ygHbVuFthSc60TQfwY8h7pXtlCYgIIFnSId2J6XW7jUc6g_wjlyW83vqP1WyTBZxW39QCdsn8ePgRdgDTjO1u7b7fqC3u7Q priority: 102 providerName: Directory of Open Access Journals |
| Title | Analysis and Research on Secondary LT Coding Anti-Eavesdropping Scheme Based on LT Code Degree-1 |
| URI | https://www.proquest.com/docview/2882387760 https://doaj.org/article/950b285071734c758da80812d0c3e035 |
| Volume | 13 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Nb9QwELWgvcAB0QJioax8AAFCFrFjJ84J7ZZdKgQVoq3Um_FnhQRJ2V2Q-PfMJM5SDuWaTKTEk5l5Y8-8IeRp6UKAuOYYligyyVPJdKM0q5qUtGy0d3272Mfj6uhMvj9X53nDbZ3LKkef2Dvq0HncI38tAAqWuq6r4s3lD4ZTo_B0NY_QuEl2uYBYi53iy3fbPRbkvNS8GOrdS8ju8VQYe4YRZFT_RKKesP86t9zHmuVdcieDRDobtLpHbsR2n9y-Qh24T_ayUa7pi8wc_fIe-TJSjFDbBjoW1dGupSeY9wa7-k0_nNLDDgMWnbWbr2xhf8V1WHVI03BBT0CF3yOdQ2gL-NggHOnbCGl5ZPw-OVsuTg-PWB6hwDxE6g1z0kXpK65tE7WrCx59Ui54rxqua2-5rbwIigdITpOwMklno9DOhlrYKqbyAdlpuzY-JDQ5q4NTogEfKZVKDsBDALihk8OzPT0hr8blND7zi-OYi28G8gxcfHN18Sfk2Vb6cuDVuEZujprZyiAbdn-hW12YbFymUYUTWvUVBdJDBhQsDhQRofBlLEo1Ic9RrwZtFl7J29x6AB-G7FdmVteAiwCYFRNyMKreZGNem7-_3qP_335MbuE0-qHW74DsbFY_4xPALBs37X_MKdmdL44_fZ72mf8fsALq4w |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9NAEB2V9AAcEC0gAgX2QAUIWdhrr70-VChpU6U0jRBNpd7c_XIuYJckgPrn-G3M2OtQDuXWq7227JndmTe7M28AXsfaWvRrOqAUxSCJyjiQuZBBmpelTHJpdFMudjJNx2fJp3NxvgG_u1oYSqvsbGJjqG1taI_8A0coGMssS8OPl98D6hpFp6tdCw3lWyvYvYZizBd2HLurXxjCLfeODlDfu5wfjmb748B3GQgMOrNVoBPtEpNGUuVO6iyMnCmFtsaIPJKZUZFKDbcishi_lVwlZaKV41Irm3GVujLG996BzYQ2UHqwORxNP39Z7_IQ66aMwjbjPo7zkM6lqWqZYE76jy9sWgbc5Bgab3f4EB54mMoG7bzagg1XbcP9a-SF27DlzcKSvfXc1e8ewUVHcsJUZVmX1sfqip1S5G3V4opNZmy_JpfJBijLYKR-uqVd1EQUMWenOIm-OTZE52rpsXawYwduvnAuiB7D2a2I9wn0qrpyT4GVWkmrBc_RSidClBrhi0XAI0tNp4uyD-87cRbGM5xTo42vBUY6JPziuvD7sLsefdkye9wwbkiaWY8hPu7mQr2YF355F7kINZeiyWlIDMZgVlFLE25DE7swFn14Q3otyGrgJxnlix_wx4h_qxhkGSIzhIZhH3Y61RfenCyLv5P_2f9vv4K749nJpJgcTY-fwz2OiKzNPNyB3mrxw71ABLXSL_00ZXBx2yvjD77CLoI |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3dT9RAEJ8gJkYfjKCGU9R9kKgxDe22224fjDk4ThAkJkDC27KfFxNo8e7U8K_51znTjxMf8I3Xdtu0s7Mzv9md-Q3A69Q4h37NRJSiGGVJSCNZChnlZQgyK6U1TbnYl8N89yT7fCpOl-B3XwtDaZW9TWwMtast7ZFvcoSCqSyKPN4MXVrE19H44-X3iDpI0Ulr306jVZF9f_ULw7fZh70RzvUG5-Od4-3dqOswEFl0ZPPIZMZnNk-kLr00RZx4G4Rx1ooykYXVic4tdyJxGLsFrrOQGe25NNoVXOc-pPjeO3C3SHGdUJX6-NNif4f4NmUSt7n2aVrGdCJN9coEcPJ_vGDTLOAml9D4ufEjeNgBVDZsNWoFlny1Cg-u0RauwkpnEGbsbcda_e4xnPX0JkxXjvUJfayu2BHF3E5Pr9jBMduuyVmyYTX_Fu3on37mpjVRREzYEarPhWdb6FYdPdYO9mzkJ1Pvo-QJnNyKcJ_CclVXfg1YMFo6I3iJ9jkTIhgELg6hjgyGzhXlAN734lS24zanFhvnCmMcEr66LvwBbCxGX7acHjeM26KZWYwhJu7mQj2dqG5hq1LEhkvRZDNkFqMvp6mZCXexTX2cigG8oXlVZC_wk6zuyh7wx4h5Sw2LAjEZgsJ4AOv91KvOkMzUX7V_9v_br-Aergd1sHe4_xzuc4RibcrhOizPpz_8C4ROc_Oy0VEGZ7e9KP4AhaosHg |
| 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=Analysis+and+Research+on+Secondary+LT+Coding+Anti-Eavesdropping+Scheme+Based+on+LT+Code+Degree-1&rft.jtitle=Applied+sciences&rft.au=Wang%2C+Lizheng&rft.au=Niu%2C+Fanglin&rft.au=Jin%2C+Jingjing&rft.au=Yu%2C+Ling&rft.date=2023-10-01&rft.pub=MDPI+AG&rft.eissn=2076-3417&rft.volume=13&rft.issue=20&rft.spage=11296&rft_id=info:doi/10.3390%2Fapp132011296&rft.externalDBID=HAS_PDF_LINK |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon |