Trellis Matched Codes For Partial Response Channels

dc.creatorUchoa Filho Bartolomeu F.
dc.creatorHerro Mark A.
dc.date1997
dc.date2015-06-30T14:50:39Z
dc.date2015-11-26T15:09:53Z
dc.date2015-06-30T14:50:39Z
dc.date2015-11-26T15:09:53Z
dc.date.accessioned2018-03-28T22:20:04Z
dc.date.available2018-03-28T22:20:04Z
dc.identifier
dc.identifierIeee International Symposium On Information Theory - Proceedings. Ieee, Piscataway, Nj, United States, v. , n. , p. 98 - , 1997.
dc.identifier
dc.identifier
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-0030702577&partnerID=40&md5=aa66593842267ec1699a61e4b55daddc
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/100338
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/100338
dc.identifier2-s2.0-0030702577
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1257926
dc.descriptionThe paper considers the design of zero run-length limited (ZRLL) trellis codes with large minimum free squared Euclidean distance, dfree 2, and low state-complexity, for the Pn(D) = (1-D)(1+D)n partial response channels, where n is a nonnegative integer.
dc.description
dc.description
dc.description98
dc.description
dc.languageen
dc.publisherIEEE, Piscataway, NJ, United States
dc.relationIEEE International Symposium on Information Theory - Proceedings
dc.rightsfechado
dc.sourceScopus
dc.titleTrellis Matched Codes For Partial Response Channels
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución