{"entities":{"Q693814":{"pageid":695663,"ns":120,"title":"Item:Q693814","lastrevid":63678846,"modified":"2026-04-11T14:48:29Z","type":"item","id":"Q693814","labels":{"en":{"language":"en","value":"Efficient dual domain decoding of linear block codes using genetic algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6114816"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$FE71F57B-A3E9-479D-B95F-E451B033986A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5347c2b92f59d15a5bc5bc2a1a1de5e83829acb2","datavalue":{"value":{"text":"Efficient dual domain decoding of linear block codes using genetic algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q693814$E5CCCF8D-C5A2-46F2-98BD-41DC3ACB407F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7606fd571bb31cf64a64d20ee1c2220757023a19","datavalue":{"value":"1253.94078","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q693814$EB1EFD21-5BF1-4FFC-B4E0-9039BEF08F6F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"58e8b6e18bce08f51d2c7d799f74a8b9d68a0b95","datavalue":{"value":"10.1155/2012/503834","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q693814$E8C8803F-D6A3-43C5-AF7E-6DFFD165AD89","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cad12865b7170973b8f4a66b10bf21d844de9151","datavalue":{"value":{"entity-type":"item","numeric-id":693811,"id":"Q693811"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$99987770-C9FC-48E8-817A-81421AE9C067","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"6998eb987bb4a4513926e403a993b552116bda77","datavalue":{"value":{"entity-type":"item","numeric-id":693812,"id":"Q693812"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$310585BC-49B1-446B-A7C2-44B2ECA6D316","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0e9c95f31ca0f49a4479051e2426030f3bcbf8ac","datavalue":{"value":{"entity-type":"item","numeric-id":693813,"id":"Q693813"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$2300642C-A988-4D43-A0A6-7357803CEF1E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"d0566231dc595afdfc5de67792cf67b196a5aec4","datavalue":{"value":{"entity-type":"item","numeric-id":355841,"id":"Q355841"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$F79B273B-6017-4D9C-B1E9-D203C83E74BD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aaff6a94ac821c6dcde7cb7d6a059bb2e8edd01d","datavalue":{"value":{"time":"+2012-12-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q693814$6C64041E-CFF0-445E-A92A-5716F87D84DE","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"92412ef161d91b78307dcb349b2087dcf692564a","datavalue":{"value":"Summary: A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.","type":"string"},"datatype":"string"},"type":"statement","id":"Q693814$1B361E2B-8DAF-4B19-B9CB-FAA3E1FF82C0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4430c94528f7856126af01b3ac6ccc7f8c77602b","datavalue":{"value":"94B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q693814$8DD45B29-4A82-4624-BEA4-14F0AD39FFFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"06c948fd44541499360dc4d8f03d345101abad05","datavalue":{"value":"94B60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q693814$E198E105-F657-4F52-9FFF-D18014845503","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a0dc380a7a6964f00e6560e4112710836960e832","datavalue":{"value":"68T20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q693814$42AFDF28-4272-4E6C-BD75-3F1DACA73D50","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"488035f47972ea21f18d8d9a2e7c3cec2e50ef1f","datavalue":{"value":"6114816","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q693814$B314AC1C-31C0-4D7F-A28C-64B1A8897513","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"1e346b05f0fecc0cfc23419dbda74de95f1ddd47","datavalue":{"value":"Q58908576","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q693814$D8799B0D-961B-4DCD-A9FF-DE488D95339C","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$8C5826F5-BD0E-422A-B842-DDBDCA51AB1A","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"347e492bac6977c6be4acc59a82c8e631f1fd087","datavalue":{"value":"https://doi.org/10.1155/2012/503834","type":"string"},"datatype":"url"},"type":"statement","id":"Q693814$5E3FA308-5F54-4B2A-947A-95E1FD91489A","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"133b956e4300371b5e7b96ddd2005709193b4f45","datavalue":{"value":"W1992342254","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q693814$F2EA03C6-646D-4106-B720-6A3426FBE501","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"598523ed81c9c46737a0dca70cede1f2a4eb9511","datavalue":{"value":{"entity-type":"item","numeric-id":4692508,"id":"Q4692508"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$1EF507E7-D9C1-471E-8874-E0A7959D6506","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e5e5b8869b5daa5a9ba1c3b911154a80f3e759c5","datavalue":{"value":{"entity-type":"item","numeric-id":4859761,"id":"Q4859761"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$B8AED2FC-1E2A-4995-83B7-E7F270C1613D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8ecc957e35c47ef81a9cdfd670b6bbb96813638f","datavalue":{"value":{"entity-type":"item","numeric-id":4392476,"id":"Q4392476"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$EC2F24A9-28F3-4C4B-9B9D-BE0E7E8269D9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5af84f2fe0caf61779f91291d50a824cfb43adc9","datavalue":{"value":{"entity-type":"item","numeric-id":5635335,"id":"Q5635335"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$97AC5664-EE83-4947-BDAF-A1A03D647D3A","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a65af141b0cdc8951da6c3ce21c2d5971d834dba","datavalue":{"value":{"entity-type":"item","numeric-id":693830,"id":"Q693830"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"1bc3be9ca556ebed64cdfd7d9e4b9e4f82b21d8f","datavalue":{"value":{"amount":"+0.8764568","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q693814$46D70692-0ACE-4D38-81DF-7F8D5C0B28D5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fb41de96661e033a6feff1f92c54f38ba0dc60a2","datavalue":{"value":{"entity-type":"item","numeric-id":4630314,"id":"Q4630314"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e526f4966f8f9d8c927049e6d0786e485c610a85","datavalue":{"value":{"amount":"+0.8571491","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q693814$707BB1AC-33D1-4393-8353-477AA5864E5F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5fb4fabfb5551b741df9afd562434243fb2cbc8d","datavalue":{"value":{"entity-type":"item","numeric-id":3563244,"id":"Q3563244"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5f73a75d9f4094db287216d538f97724aede9551","datavalue":{"value":{"amount":"+0.84993875","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q693814$2E444778-08E2-40A0-9A88-FC67A3FD628D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c6cd8148db2910bd6c860cd965f463f71e3c48b2","datavalue":{"value":{"entity-type":"item","numeric-id":1773735,"id":"Q1773735"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"51c7b5f66a8d1202eda539725fda8c9b57c8f7e1","datavalue":{"value":{"amount":"+0.8439684","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q693814$D2F8AF5D-0E45-475A-8C87-4BAA384E4A20","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5d051547d54ce50946db24210c3e838717dbbc89","datavalue":{"value":{"entity-type":"item","numeric-id":1762065,"id":"Q1762065"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9b6071dd8f75554dd9d92ee3a06d11685c2fb9b4","datavalue":{"value":{"amount":"+0.8402727","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q693814$F328EB87-56E7-4BE8-8A67-F8A945731F02","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f461fada07ff99a69886eac341395173cb427d44","datavalue":{"value":{"entity-type":"item","numeric-id":4943037,"id":"Q4943037"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ac801b9f3c359afb73616f2de3efb343c7f237c1","datavalue":{"value":{"amount":"+0.8299754","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q693814$5004F0DA-AE9E-4254-AEE9-B62EB3CEE805","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6424149de1c8749bcd5f8663165c2abec8a3aa0d","datavalue":{"value":{"entity-type":"item","numeric-id":3979601,"id":"Q3979601"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f19d217a796332855bc2ecacb76e6641997e1b3b","datavalue":{"value":{"amount":"+0.8271422","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"ac3c626774dcd0d16f89557f66586245841a01db","datavalue":{"value":{"entity-type":"item","numeric-id":6767936,"id":"Q6767936"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q693814$E25ACCCA-AFFD-40E5-A5B7-393451825302","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q693814$01A63577-0737-4A58-9AFD-8E0DA279E3AF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient dual domain decoding of linear block codes using genetic algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_dual_domain_decoding_of_linear_block_codes_using_genetic_algorithms"}}}}}