Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao https://doi.org/10.1...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1109/redund...
Article . 2021 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
https://dx.doi.org/10.1109/red...
Other literature type
Data sources: Microsoft Academic Graph
 View all 1 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Extended EVENODD+ Codes with Asymptotically Optimal Updates and Efficient Encoding/Decoding

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 25 Oct 2021Publisher:IEEEJournal:2021 XVII International Symposium "Problems of Redundancy in Information and Control Systems" (REDUNDANCY)
Authors: Hong Fu; Hanxu Hou; Li Zhang;

doi: 10.1109/redundancy52534.2021.9606450

Extended EVENODD+ Codes with Asymptotically Optimal Updates and Efficient Encoding/Decoding

Abstract

Extended EVENODD (EEOD) codes are binary maximum distance separable (MDS) array codes that can correct any three-column failures. However, the update complexity of EEOD codes is sub-optimal. In this paper, we propose Extended EVENODD+ (EEOD+) codes, of which the update complexity is asymptotically optimal. In addition, we present efficient encoding/decoding method for the EEOD+ codes. We show that our EEOD+ codes have less computational complexity than EEOD codes, in terms of encoding/decoding/update.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 5
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
5
Top 10%
Average
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!
uploadUpload now