Show simple item record

Incremental calculation of minimum-redundancy length-restricted codes

dc.contributor.authorLiddell, M
dc.contributor.authorMoffat, A
dc.date.available2014-05-22T01:11:07Z
dc.date.issued2007-03-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000245149000008&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c
dc.identifier.citationLiddell, M. & Moffat, A. (2007). Incremental calculation of minimum-redundancy length-restricted codes. IEEE TRANSACTIONS ON COMMUNICATIONS, 55 (3), pp.427-435. https://doi.org/10.1109/TCOMM.2007.892446.
dc.identifier.issn0090-6778
dc.identifier.urihttp://hdl.handle.net/11343/30514
dc.languageEnglish
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.subjectCommunications Technologies
dc.titleIncremental calculation of minimum-redundancy length-restricted codes
dc.typeJournal Article
dc.identifier.doi10.1109/TCOMM.2007.892446
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentComputer Science and Software Engineering
melbourne.source.titleIEEE TRANSACTIONS ON COMMUNICATIONS
melbourne.source.volume55
melbourne.source.issue3
melbourne.source.pages427-435
dc.research.codefor1005
dc.description.pagestart427
melbourne.publicationid85893
melbourne.elementsid293709
melbourne.contributor.authorMoffat, Alistair
melbourne.internal.ingestnoteAbstract bulk upload (2017-07-24)
dc.identifier.eissn1558-0857
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record