Show simple item record

dc.contributor.authorShafarenko, A.
dc.contributor.authorSkidin, A.
dc.contributor.authorTuritsyn, S.K.
dc.date.accessioned2010-11-15T13:46:33Z
dc.date.available2010-11-15T13:46:33Z
dc.date.issued2010-10
dc.identifier.citationShafarenko , A , Skidin , A & Turitsyn , S K 2010 , ' Weakly-Constrained Codes for Suppression of Patterning Effects in Digital Communications ' , IEEE Transactions on Communications , vol. 58 , no. 10 , pp. 2845-2854 . https://doi.org/10.1109/TCOMM.2010.080310.100026
dc.identifier.issn0090-6778
dc.identifier.otherPURE: 88597
dc.identifier.otherPURE UUID: 0c1f2656-ed7e-480b-91c5-a2178c781c1d
dc.identifier.otherdspace: 2299/4986
dc.identifier.otherScopus: 77958112589
dc.identifier.urihttp://hdl.handle.net/2299/4986
dc.description“This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder." “Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.”
dc.description.abstractWe propose weakly-constrained stream and block codes with tunable pattern-dependent statistics and demonstrate that the block code capacity at large block sizes is close to the the prediction obtained from a simple Markov model published earlier. We demonstrate the feasibility of the code by presenting original encoding and decoding algorithms with a complexity log-linear in the block size and with modest table memory requirements. We also show that when such codes are used for mitigation of patterning effects in optical fibre communications, a gain of about 0.5 dB is possible under realistic conditions, at the expense of small redundancy (≈10%).en
dc.language.isoeng
dc.relation.ispartofIEEE Transactions on Communications
dc.rights/dk/atira/pure/core/openaccesspermission/open
dc.titleWeakly-Constrained Codes for Suppression of Patterning Effects in Digital Communicationsen
dc.contributor.institutionSchool of Computer Science
dc.contributor.institutionScience & Technology Research Institute
dc.contributor.institutionCentre for Computer Science and Informatics Research
dc.description.statusPeer reviewed
dc.relation.schoolSchool of Computer Science
rioxxterms.versionSMUR
rioxxterms.versionofrecordhttps://doi.org/10.1109/TCOMM.2010.080310.100026
rioxxterms.typeJournal Article/Review
herts.preservation.rarelyaccessedtrue
herts.rights.accesstyperestrictedAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record