On write-unidirectional memory codes

DOI10.1109/18.30992zbMath0676.94020OpenAlexW2061403121MaRDI QIDQ3832472

Gábor Simonyi

Publication date: 1989

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.30992

zbMATH Keywords

decoderbinary sequencesFibonacci sequencesencoderBorden's converse boundcodes of rate 0.5325rewritable optical disksWrite-unidirectional memories

Mathematics Subject Classification ID

Other types of codes (94B60) Decoding (94B35)

Related Items (6)

Cancellative pairs of families of sets ⋮ Prediction and entropy of nonlinear dynamical systems and symbolic sequences with LRO ⋮ Coding for write-efficient memory ⋮ Word frequency and entropy of symbolic sequences: A dynamical perspective ⋮ Coding for write-unidirectional memories and conflict resolution ⋮ On the optimal structure of recovering set pairs in lattices: The sandglass conjecture

This page was built for publication: On write-unidirectional memory codes