000 01912cam  2200313zi 4500
0019.876671
003CaOODSP
00520221107164753
006m     o  d f      
007cr |n|||||||||
008190719e197608##oncd|||#ob   f000 0|eng d
040 |aCaOODSP|beng|erda|cCaOODSP
043 |an-cn---
0861 |aCo24-120/1976E-PDF
1001 |aTavares, Stafford, |d1940- |eauthor.
24510|aRedundancy removal in binary sources : |bfinal report / |cStafford Tavares.
264 1|a[Ottawa] : |b[Department of Communications], |cAugust 1976.
300 |a1 online resource (34 pages) : |bfigures, graphs
336 |atext|btxt|2rdacontent
337 |acomputer|bc|2rdamedia
338 |aonline resource|bcr|2rdacarrier
500 |aDigitized edition from print [produced by Innovation, Science and Economic Development Canada].
500 |a"Contract No. OSU5-0141."
504 |aIncludes bibliographical references (page 8).
520 |a"In this report, we continue our investigation of the compression of binary information sources using rate - 1/2 convolutional codes. In the preliminary report, we provided some of the background which encourages one to investigate data compression by this means. Our early simulation results were promising and further simulations have been conducted. Initially, we used first, second and third order binary Markov sources. Although these provided us with some insights, it was decided that we should restrict ourselves to simpler sources so that we can relate our results to current theoretical investigations. The source which met this requirement is the Binary Symmetric Markov Source (BSMS)"--Introduction, page 1.
69207|2gccst|aTelecommunications
7101 |aCanada. |bDepartment of Communications.
85640|qPDF|s1.84 MB|uhttps://publications.gc.ca/collections/collection_2019/isde-ised/Co24/Co24-120-1976-eng.pdf