{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:01:25Z","timestamp":1743148885231,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031609930"},{"type":"electronic","value":"9783031609947"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60994-7_29","type":"book-chapter","created":{"date-parts":[[2024,5,26]],"date-time":"2024-05-26T23:04:39Z","timestamp":1716764679000},"page":"346-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparison of\u00a0Probabilistic Characteristics of\u00a08-Bit Codes with\u00a0Direct Error Correction"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Vladimerov","sequence":"first","affiliation":[]},{"given":"Ahliddinzoda","family":"Asliddin","sequence":"additional","affiliation":[]},{"given":"Olga","family":"Vorozheikina","sequence":"additional","affiliation":[]},{"given":"Ammar","family":"Muthanna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,26]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Clark, G.C., Jr., Cain, J.B.: Error-Correction Coding for Digital Communications. Plenum Press, New York (1981)","DOI":"10.1007\/978-1-4899-2174-1"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Morelos-Zaragoza, R.H.: The Art of Error Correcting Coding, p. 232. John Wiley & Sons Ltd, Chichester (2002). ISBN 0471-49581-6","DOI":"10.1002\/0470847824"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Kadel, R., Islam, N., Ahmed, K., Halder, S.J.: Opportunities and challenges for error correction scheme for wireless body area network - a survey. J. Sensor Actuator Netw. 8(1), 1\u201322 (2019). ISSN: 2224-2708","DOI":"10.3390\/jsan8010001"},{"key":"29_CR4","unstructured":"Nazirov, R., Zolotarev, V., Ovechkin, G., Ovechkin, P., Chulkov, I.: Effective non-bynary multiihreshold decoding for remote earth sensyng systems. Sovremennye problemy distantsionnogo zondirovaniya Zemli iz kosmosa 7(2), 269\u2013274 (2010). (In Russian)"},{"key":"29_CR5","unstructured":"ITU-T G.975. Forward error correction for submarine systems. Geneva: ITU, p. 21 (2000)"},{"key":"29_CR6","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-981-10-8585-7_7","volume-title":"Communication, Devices, and Computing","author":"J Samanta","year":"2017","unstructured":"Samanta, J., Bhaumik, J., Barman, S., Hossain, S.G.S., Sahu, M., Dutta, S.: RS (255, 249) codec based on all primitive polynomials over GF($$2^8$$). In: Bhaumik, J., Chakrabarti, I., De, B.P., Bag, B., Mukherjee, S. (eds.) Communication, Devices, and Computing. LNEE, vol. 470, pp. 69\u201381. Springer, Singapore (2017). https:\/\/doi.org\/10.1007\/978-981-10-8585-7_7"},{"key":"29_CR7","unstructured":"Babaie, S., Khosrohosseini, A., Ghasemkhani, B., Ghaffari, A.: HCAP: hamming code with additional parity method for error control in wireless sensor networks. In: 2010 International Conference on Intelligent Network and Computing (ICINC 2010), pp. 410\u2013415 (2010)"},{"key":"29_CR8","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)"},{"key":"29_CR9","unstructured":"Werner, M.: Information und Codierung: Grundlagen und Anwendungen. Springer-Verlag, Wiesbaden (2008). (In German)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2019\/3905094","volume":"2019","author":"C Hillier","year":"2019","unstructured":"Hillier, C., Balyan, V.: Error detection and correction on-board nanosatellites using hamming codes. J. Elect. Comput. Eng. 2019, 1\u201315 (2019)","journal-title":"J. Elect. Comput. Eng."},{"key":"29_CR11","unstructured":"Shuvalov, V.P. (ed.): Peredacha diskretnyh soobscheniy [Digital Data Transmission] Moscow: Radio i svyaz (1990). (In Russian)"},{"key":"29_CR12","unstructured":"Vladimirov S.S.: About the Majority-Logic Decoding of Shortened Maximum Length Code with K Linear-Independent Elements. Actual\u2019nye problemy infotelekommunikatziy v nauke i obrazovanii. Sbornik nauchnyh statey V mezhdunarodnoy nauchno-tehnicheskoy i nauchno-metodicheskoy konferencii. St.-Petersburg. St.Petersburg State University of Telecommunications, pp. 276\u2013281 (2016). (In Russian)"},{"key":"29_CR13","unstructured":"Kognovitsky, O.: Dvoystvenniy bazis i ego primenenie v telecommunikatziyah [Dual Basis and its Appliance in Telecommunication]. St.-Petersburg: Link. 2009. 423 p. (In Russian) Vladimirov S. S. Modelirovanie protzessov mazhoritarnogo dekodirovaniya po k lineyno-nezavisimym kombinatziyam \/ S. S. Vladimirov \/\/ Nauchno-tehnicheskie vedomosti Sankt-Peterburgskogo gosudarstvennogo politehnicheskogo universiteta. Informatika. Telekommunikatzii. Upravlenie, vol. 5(65), 86\u201392 (2008). (In Russian)"},{"key":"29_CR14","unstructured":"Vladimirov S.: The efficiency of maximum length code majority-logic decoding algorithm with k-ary linear-independent subsequences in binary symmetric channel. Telecom IT 4(12), 108\u2013119 (2015). (In Russian)"},{"key":"29_CR15","unstructured":"Fink, L.M.: Teoriya peredachi diskretnyh soobscheniy [Digital Data Transmission Theory]. Sovetskoe radio, Moscow (1970). (In Russian)"},{"key":"29_CR16","unstructured":"Deev, V.V.: Metody modulyatzii i kodirovaniya v sovremennyh sistemah svyazi [Modulation and Coding in Modern Communication Systems]. Nauka, St.-Petersburg (2007). (In Russian)"},{"key":"29_CR17","unstructured":"Zyuko A.G., Klovskiy D.D., Nazarov M.V., Fink L.M. Teoriya peredachi signalov [Signal Transmission Theory]. Moscow: Svyaz (1980). (In Russian)"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networks and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60994-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,26]],"date-time":"2024-05-26T23:11:40Z","timestamp":1716765100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60994-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031609930","9783031609947"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60994-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NEW2AN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Next Generation Wired\/Wireless Networking","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"new2an2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/new2an.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"256","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}