{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-04-06T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":185,"title":"Data decompression","description":"A chunk of data is to be 'decompressed'.\r\n\r\nInput:\r\n\r\n* compressed: a row vector of uint8 values. This is the compressed data.\r\n* table: a cell-array of strings. Each string contains only '1's and '0's and represents a binary code.\r\n* alphabet: a string containing all possible symbols that may occur in the decompressed data. The symbol at alphabet(x) is encoded with the code at table{x}.\r\n\r\nOutput:\r\n\r\n* decompressed: a string with the decoded message.\r\n\r\nExample:\r\n\r\n  compressed=[93,85,127]\r\n  table={'1','010'}\r\n  alphabet='al'\r\n==\u003e  decompressed = 'laaalalalaaaaaaa'\r\n\r\nbecause:  \r\n\r\n  [93,85,127] = '01011101 01010101 01111111' in binary\r\n  decoded from left to right:\r\n  '010 1 1 1 010 1 010 1 010 1 1 1 1 1 1 1'\r\n  = l  a a a  l  a  l  a  l  a a a a a a a\r\n\r\nRemarks: The message is such that always exactly all bits of |compressed| are used. The solution is unique (see \u003chttp://en.wikipedia.org/wiki/Prefix_code prefix-free code\u003e).","description_html":"\u003cp\u003eA chunk of data is to be 'decompressed'.\u003c/p\u003e\u003cp\u003eInput:\u003c/p\u003e\u003cul\u003e\u003cli\u003ecompressed: a row vector of uint8 values. This is the compressed data.\u003c/li\u003e\u003cli\u003etable: a cell-array of strings. Each string contains only '1's and '0's and represents a binary code.\u003c/li\u003e\u003cli\u003ealphabet: a string containing all possible symbols that may occur in the decompressed data. The symbol at alphabet(x) is encoded with the code at table{x}.\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eOutput:\u003c/p\u003e\u003cul\u003e\u003cli\u003edecompressed: a string with the decoded message.\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ecompressed=[93,85,127]\r\ntable={'1','010'}\r\nalphabet='al'\r\n==\u003e  decompressed = 'laaalalalaaaaaaa'\r\n\u003c/pre\u003e\u003cp\u003ebecause:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[93,85,127] = '01011101 01010101 01111111' in binary\r\ndecoded from left to right:\r\n'010 1 1 1 010 1 010 1 010 1 1 1 1 1 1 1'\r\n= l  a a a  l  a  l  a  l  a a a a a a a\r\n\u003c/pre\u003e\u003cp\u003eRemarks: The message is such that always exactly all bits of \u003ctt\u003ecompressed\u003c/tt\u003e are used. The solution is unique (see \u003ca href=\"http://en.wikipedia.org/wiki/Prefix_code\"\u003eprefix-free code\u003c/a\u003e).\u003c/p\u003e","function_template":"function decompressed = decode(compressed,table,alphabet)\r\n  decompressed = char(compressed);\r\nend","test_suite":"%% the example from the problem description\r\nalphabet = 'al';\r\ntable = {'1','010'};\r\ncompressed = [93,85,127];\r\nassert(isequal(decode(compressed,table,alphabet),'laaalalalaaaaaaa'))\r\n\r\n%% another short test\r\nalphabet = 'ehlo';\r\ntable = {'00','01','10','11'};\r\ncompressed = uint8([74 210 191]);\r\nassert(isequal(decode(compressed,table,alphabet),'hellohellooo'))\r\n\r\n%% longer test\r\nalphabet = ',.kcgIblowaisnufhe try';\r\ntable = {'000000','000001','00001','000100','000101','000110','000111','001','010','01100','01101','0111','1000','10010','10011','10100','10101','1011','110','1110','11110','11111'};\r\ncompressed = uint8([27 179 198 146 236 197 238 174 234 222 29 117 111 217 83 5 201 121 11 190 167 232 179 64 52 60 132 189 245 60 210 198 254 48 92 157 245 63 69 154 110 75 22 245 131 182]);\r\nassert(isequal(decode(compressed,table,alphabet),'It is not worth the bother of killing yourself, since you always kill yourself too late.   '))\r\n\r\n%% randomized test (random alphabet)\r\nalphabet = char(randi(13)+96); alphabet=[alphabet alphabet+randi(13)];\r\ntable = {'1','010'};\r\nn=randi(5)+2;\r\ncompressed = repmat([93,85,127],1,n);\r\nassert(isequal(decode(compressed,table,alphabet),regexprep(regexprep(repmat('laaalalalaaaaaaa',1,n),'l',alphabet(2)),'a',alphabet(1)) ))\r\n\r\n%% another randomized test (random code)\r\ncompressed = char(randi(26,1,42)+96);\r\nalphabet = unique(compressed);\r\ncompressed = uint8(compressed);\r\ntable = cellstr(dec2bin(alphabet,8));\r\nassert(isequal(decode(compressed,table,alphabet), char(compressed)));","published":true,"deleted":false,"likes_count":6,"comments_count":2,"created_by":203,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":94,"test_suite_updated_at":"2012-02-01T19:00:28.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-01-30T21:19:56.000Z","updated_at":"2026-03-08T18:55:42.000Z","published_at":"2012-02-01T19:14:05.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA chunk of data is to be 'decompressed'.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ecompressed: a row vector of uint8 values. This is the compressed data.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003etable: a cell-array of strings. Each string contains only '1's and '0's and represents a binary code.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ealphabet: a string containing all possible symbols that may occur in the decompressed data. The symbol at alphabet(x) is encoded with the code at table{x}.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003edecompressed: a string with the decoded message.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[compressed=[93,85,127]\\ntable={'1','010'}\\nalphabet='al'\\n==\u003e  decompressed = 'laaalalalaaaaaaa']]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ebecause:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[[93,85,127] = '01011101 01010101 01111111' in binary\\ndecoded from left to right:\\n'010 1 1 1 010 1 010 1 010 1 1 1 1 1 1 1'\\n= l  a a a  l  a  l  a  l  a a a a a a a]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eRemarks: The message is such that always exactly all bits of\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003ecompressed\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e are used. The solution is unique (see\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://en.wikipedia.org/wiki/Prefix_code\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eprefix-free code\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e).\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":185,"title":"Data decompression","description":"A chunk of data is to be 'decompressed'.\r\n\r\nInput:\r\n\r\n* compressed: a row vector of uint8 values. This is the compressed data.\r\n* table: a cell-array of strings. Each string contains only '1's and '0's and represents a binary code.\r\n* alphabet: a string containing all possible symbols that may occur in the decompressed data. The symbol at alphabet(x) is encoded with the code at table{x}.\r\n\r\nOutput:\r\n\r\n* decompressed: a string with the decoded message.\r\n\r\nExample:\r\n\r\n  compressed=[93,85,127]\r\n  table={'1','010'}\r\n  alphabet='al'\r\n==\u003e  decompressed = 'laaalalalaaaaaaa'\r\n\r\nbecause:  \r\n\r\n  [93,85,127] = '01011101 01010101 01111111' in binary\r\n  decoded from left to right:\r\n  '010 1 1 1 010 1 010 1 010 1 1 1 1 1 1 1'\r\n  = l  a a a  l  a  l  a  l  a a a a a a a\r\n\r\nRemarks: The message is such that always exactly all bits of |compressed| are used. The solution is unique (see \u003chttp://en.wikipedia.org/wiki/Prefix_code prefix-free code\u003e).","description_html":"\u003cp\u003eA chunk of data is to be 'decompressed'.\u003c/p\u003e\u003cp\u003eInput:\u003c/p\u003e\u003cul\u003e\u003cli\u003ecompressed: a row vector of uint8 values. This is the compressed data.\u003c/li\u003e\u003cli\u003etable: a cell-array of strings. Each string contains only '1's and '0's and represents a binary code.\u003c/li\u003e\u003cli\u003ealphabet: a string containing all possible symbols that may occur in the decompressed data. The symbol at alphabet(x) is encoded with the code at table{x}.\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eOutput:\u003c/p\u003e\u003cul\u003e\u003cli\u003edecompressed: a string with the decoded message.\u003c/li\u003e\u003c/ul\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003ecompressed=[93,85,127]\r\ntable={'1','010'}\r\nalphabet='al'\r\n==\u003e  decompressed = 'laaalalalaaaaaaa'\r\n\u003c/pre\u003e\u003cp\u003ebecause:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003e[93,85,127] = '01011101 01010101 01111111' in binary\r\ndecoded from left to right:\r\n'010 1 1 1 010 1 010 1 010 1 1 1 1 1 1 1'\r\n= l  a a a  l  a  l  a  l  a a a a a a a\r\n\u003c/pre\u003e\u003cp\u003eRemarks: The message is such that always exactly all bits of \u003ctt\u003ecompressed\u003c/tt\u003e are used. The solution is unique (see \u003ca href=\"http://en.wikipedia.org/wiki/Prefix_code\"\u003eprefix-free code\u003c/a\u003e).\u003c/p\u003e","function_template":"function decompressed = decode(compressed,table,alphabet)\r\n  decompressed = char(compressed);\r\nend","test_suite":"%% the example from the problem description\r\nalphabet = 'al';\r\ntable = {'1','010'};\r\ncompressed = [93,85,127];\r\nassert(isequal(decode(compressed,table,alphabet),'laaalalalaaaaaaa'))\r\n\r\n%% another short test\r\nalphabet = 'ehlo';\r\ntable = {'00','01','10','11'};\r\ncompressed = uint8([74 210 191]);\r\nassert(isequal(decode(compressed,table,alphabet),'hellohellooo'))\r\n\r\n%% longer test\r\nalphabet = ',.kcgIblowaisnufhe try';\r\ntable = {'000000','000001','00001','000100','000101','000110','000111','001','010','01100','01101','0111','1000','10010','10011','10100','10101','1011','110','1110','11110','11111'};\r\ncompressed = uint8([27 179 198 146 236 197 238 174 234 222 29 117 111 217 83 5 201 121 11 190 167 232 179 64 52 60 132 189 245 60 210 198 254 48 92 157 245 63 69 154 110 75 22 245 131 182]);\r\nassert(isequal(decode(compressed,table,alphabet),'It is not worth the bother of killing yourself, since you always kill yourself too late.   '))\r\n\r\n%% randomized test (random alphabet)\r\nalphabet = char(randi(13)+96); alphabet=[alphabet alphabet+randi(13)];\r\ntable = {'1','010'};\r\nn=randi(5)+2;\r\ncompressed = repmat([93,85,127],1,n);\r\nassert(isequal(decode(compressed,table,alphabet),regexprep(regexprep(repmat('laaalalalaaaaaaa',1,n),'l',alphabet(2)),'a',alphabet(1)) ))\r\n\r\n%% another randomized test (random code)\r\ncompressed = char(randi(26,1,42)+96);\r\nalphabet = unique(compressed);\r\ncompressed = uint8(compressed);\r\ntable = cellstr(dec2bin(alphabet,8));\r\nassert(isequal(decode(compressed,table,alphabet), char(compressed)));","published":true,"deleted":false,"likes_count":6,"comments_count":2,"created_by":203,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":94,"test_suite_updated_at":"2012-02-01T19:00:28.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2012-01-30T21:19:56.000Z","updated_at":"2026-03-08T18:55:42.000Z","published_at":"2012-02-01T19:14:05.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eA chunk of data is to be 'decompressed'.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eInput:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ecompressed: a row vector of uint8 values. This is the compressed data.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003etable: a cell-array of strings. Each string contains only '1's and '0's and represents a binary code.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ealphabet: a string containing all possible symbols that may occur in the decompressed data. The symbol at alphabet(x) is encoded with the code at table{x}.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eOutput:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"ListParagraph\\\"/\u003e\u003cw:numPr\u003e\u003cw:numId w:val=\\\"1\\\"/\u003e\u003c/w:numPr\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003edecompressed: a string with the decoded message.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[compressed=[93,85,127]\\ntable={'1','010'}\\nalphabet='al'\\n==\u003e  decompressed = 'laaalalalaaaaaaa']]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003ebecause:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[[93,85,127] = '01011101 01010101 01111111' in binary\\ndecoded from left to right:\\n'010 1 1 1 010 1 010 1 010 1 1 1 1 1 1 1'\\n= l  a a a  l  a  l  a  l  a a a a a a a]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eRemarks: The message is such that always exactly all bits of\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:rPr\u003e\u003cw:rFonts w:cs=\\\"monospace\\\"/\u003e\u003c/w:rPr\u003e\u003cw:t\u003ecompressed\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e are used. The solution is unique (see\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"http://en.wikipedia.org/wiki/Prefix_code\\\"\u003e\u003cw:r\u003e\u003cw:t\u003eprefix-free code\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e).\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"term":"tag:\"prefix free codes\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"prefix free codes\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"prefix free codes\"","","\"","prefix free codes","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f64ba0dd218\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f64ba0dd178\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f64ba0dc1d8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f64ba0dd7b8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f64ba0dd538\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f64ba0dd498\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f64ba0dd3f8\u003e":"tag:\"prefix free codes\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f64ba0dd3f8\u003e":"tag:\"prefix free codes\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"cody-search","password":"78X075ddcV44","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"prefix free codes\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"prefix free codes\"","","\"","prefix free codes","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007f64ba0dd218\u003e":null,"#\u003cMathWorks::Search::Field:0x00007f64ba0dd178\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007f64ba0dc1d8\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007f64ba0dd7b8\u003e":1,"#\u003cMathWorks::Search::Field:0x00007f64ba0dd538\u003e":50,"#\u003cMathWorks::Search::Field:0x00007f64ba0dd498\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007f64ba0dd3f8\u003e":"tag:\"prefix free codes\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007f64ba0dd3f8\u003e":"tag:\"prefix free codes\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":185,"difficulty_rating":"medium"}]}}