{"title":"多位标志的Ziv-Lempel编码","authors":"P. Fenwick","doi":"10.1109/DCC.1993.253136","DOIUrl":null,"url":null,"abstract":"LZ77 and more recently LZSS text compression use one-bit flags to identify a following pointer or literal. This paper investigates the use of multi-bit flags to allow a greater variety of entities in the compressed data stream. Two approaches are described. The first uses flags of 2 or 3 bits with operands constrained to be 1, 2 or 3 bytes long. The other codes entirely in units of 2 or 3 bits (instead of the more usual single bits). Both methods are shown to yield compressors of good performance.<<ETX>>","PeriodicalId":315077,"journal":{"name":"[Proceedings] DCC `93: Data Compression Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Ziv-Lempel encoding with multi-bit flags\",\"authors\":\"P. Fenwick\",\"doi\":\"10.1109/DCC.1993.253136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"LZ77 and more recently LZSS text compression use one-bit flags to identify a following pointer or literal. This paper investigates the use of multi-bit flags to allow a greater variety of entities in the compressed data stream. Two approaches are described. The first uses flags of 2 or 3 bits with operands constrained to be 1, 2 or 3 bytes long. The other codes entirely in units of 2 or 3 bits (instead of the more usual single bits). Both methods are shown to yield compressors of good performance.<<ETX>>\",\"PeriodicalId\":315077,\"journal\":{\"name\":\"[Proceedings] DCC `93: Data Compression Conference\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] DCC `93: Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1993.253136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] DCC `93: Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1993.253136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
LZ77 and more recently LZSS text compression use one-bit flags to identify a following pointer or literal. This paper investigates the use of multi-bit flags to allow a greater variety of entities in the compressed data stream. Two approaches are described. The first uses flags of 2 or 3 bits with operands constrained to be 1, 2 or 3 bytes long. The other codes entirely in units of 2 or 3 bits (instead of the more usual single bits). Both methods are shown to yield compressors of good performance.<>