English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

To provide reliable communication in data transmission, ability of correctingerrors is of prime importance. This paper intends to suggest an easy algorithmto detect and correct errors in transmission codes using the well-knownKarnaugh map. Referring to past research done and proving new theorems and alsousing a suggested simple technique taking advantage of the easy concept ofKarnaugh map, we offer an algorithm to reduce the number of occupied squares inthe map and therefore, reduce substantially the execution time for placing databits in Karnaugh map. Based on earlier papers, we first propose an algorithmfor correction of two simultaneous errors in a code. Then, definingspecifications for empty squares of the map, we limit the choices for selectionof new squares. In addition, burst errors in sending codes is discussed, andsystematically code words for correcting them will be made.

Data Bits in Karnaugh Map and Increasing Map Capability in Error Correcting