Integer SEC-DED codes for low power communications

DOI10.1016/J.IPL.2010.04.004zbMATH Open1233.94036arXiv1209.1073OpenAlexW2050884533MaRDI QIDQ763546FDOQ763546

Aleksandar Radonjic, Vladimir Vujičić

Publication date: 12 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: This paper is a reply to the comments on 'Integer SEC-DED codes for low power communications'.

Full work available at URL: https://arxiv.org/abs/1209.1073

zbMATH Keywords

computational complexitysafety/security in digital systemsinteger SEC-DED codes

Mathematics Subject Classification ID

Synthesis problems (93B50) Arithmetic codes (94B40)

Cites Work

• Title not available (Why is that?)
• On the complexity of minimum distance decoding of long linear codes

Cited In (1)

• Comments on ``Integer SEC-DED codes for low power communications

   Recommendations

• Comments on ``Integer SEC-DED codes for low power communications 👍 👎
• Integer codes correcting single errors and burst asymmetric errors within a byte 👍 👎
• Construction techniques for systematic SEC-DED codes with single byte error detection and partial correction capability for computer memory systems 👍 👎
• New class of t-error correcting and all unidirectional error detecting (t-EC/AUED) codes 👍 👎
• Integer codes capable of correcting burst asymmetric errors 👍 👎

This page was built for publication: Integer SEC-DED codes for low power communications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763546)