{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:22:28Z","timestamp":1743020548265,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030164577"},{"type":"electronic","value":"9783030164584"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16458-4_17","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:02:19Z","timestamp":1555282939000},"page":"288-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Perfect, Hamming and Simplex Linear Error-Block Codes with Minimum $$\\pi $$-distance 3"],"prefix":"10.1007","author":[{"given":"Soukaina","family":"Belabssir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edoukou Berenger","family":"Ayebie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El Mamoun","family":"Souidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,28]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/j.ffa.2005.03.006","volume":"12","author":"K Feng","year":"2006","unstructured":"Feng, K., Xu, L., Hickernell, F.J.: Linear error-block codes. Finite Fields Appl. 12, 638\u2013652 (2006)","journal-title":"Finite Fields Appl."},{"issue":"2\/3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1504\/IJICOT.2013.059702","volume":"2","author":"R Dariti","year":"2013","unstructured":"Dariti, R., Souidi, E.M.: New families of perfect linear error-block codes. Int. J. Inf. Coding Theory 2(2\/3), 84\u201395 (2013)","journal-title":"Int. J. Inf. Coding Theory"},{"key":"17_CR3","first-page":"426","volume":"1","author":"R Dariti","year":"2012","unstructured":"Dariti, R., Souidi, E.M.: An application of linear error-block codes in steganography. Int. J. Digit. Inf. Wirel. Commun. 1, 426\u2013433 (2012)","journal-title":"Int. J. Digit. Inf. Wirel. Commun."},{"key":"17_CR4","first-page":"39","volume":"25","author":"R Dariti","year":"2011","unstructured":"Dariti, R., Souidi, E.M.: Cyclicity and decoding of linear error-block codes. J. Theorecal Appl. Inf. Technol. 25, 39\u201342 (2011)","journal-title":"J. Theorecal Appl. Inf. Technol."},{"key":"17_CR5","first-page":"13","volume":"7","author":"R Dariti","year":"2013","unstructured":"Dariti, R., Souidi, E.M.: Packing and covering radii of linear error-block codes. Int. J. Math. Sci. 7, 13\u201317 (2013)","journal-title":"Int. J. Math. Sci."},{"key":"17_CR6","first-page":"35","volume":"5","author":"P Udomkavanich","year":"2010","unstructured":"Udomkavanich, P., Jitman, S.: Bounds and modifications on linear error-block codes. Int. Math. Forum 5, 35\u201350 (2010)","journal-title":"Int. Math. Forum"},{"key":"17_CR7","unstructured":"Dariti, R.: Linear error-block codes and applications. Th\u00e8se de Doctorat, Universit\u00e9 Mohammed V-Agdal, Facult\u00e9 des Sciences (2012)"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0124010","volume":"24","author":"A Tiet\u00e4v\u00e4inen","year":"1973","unstructured":"Tiet\u00e4v\u00e4inen, A.: On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24(1), 88\u201396 (1973)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"17_CR9","first-page":"123","volume":"2","author":"VA Zinovev","year":"1973","unstructured":"Zinovev, V.A., Leontev, V.K.: Nonexistence of perfect codes over Galois fields. Probl. Control. Inf. Theory 2(2), 123\u2013132 (1973)","journal-title":"Probl. Control. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Codes, Cryptology and Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16458-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:48:02Z","timestamp":1710251282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-16458-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030164577","9783030164584"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16458-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"C2SI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Codes, Cryptology, and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"c2si2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.c2si-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","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":"19","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":"21% - 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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 invited papers and 3 workshop papers are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}