Tang, Hung-HuaHung-HuaTangMAO-CHAO LINUchôa-Filho, Bartolomeu FerreiraBartolomeu FerreiraUchôa-Filho2006-11-152018-07-062006-11-152018-07-062006-0800189448http://scholars.lib.ntu.edu.tw/handle/123456789/325379http://ntur.lib.ntu.edu.tw/bitstream/246246/200611150121244/1/556.pdfhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-33746625199&doi=10.1109%2fTIT.2006.878225&partnerID=40&md5=a1c238841bcfee5992fc06eaabf828e6In this correspondence, it is shown that some convolutional codes with distinct memory sizes of minimal encoders are equivalent in the sense that the minimal trellises of these codes are the shifted versions of one another. For an (n,k) binary convolutional code, the weight spectrum obtained from the minimal trellis may be slightly different from that obtained from the conventional code trellis with n-bit branches. Code search is conducted to find some good (n,n-1) binary convolutional codes. Bounds on the trellis complexity, measured by the number of states and the number of branches in the minimal trellis module, of any convolutional code and its equivalent codes are also derived. © 2006 IEEE.zh-TWConvolutional codes; Error-correction coding; Minimal trellis; Minimal trellis module; Trellis complexityBinary codes; Computational complexity; Convolutional codes; Error correction; Trellis codes; Minimal trellis module; Trellis complexity; Weight spectrum; Encoding (symbols)journal article10.1109/TIT.2006.8782252-s2.0-33746625199WOS:000239408700027http://ntur.lib.ntu.edu.tw/bitstream/246246/200611150121244/1/556.pdf