<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:hatena="http://www.hatena.ne.jp/info/xmlns#"
 xmlns:syn="http://purl.org/rss/1.0/modules/syndication/"
 xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/"
>

<channel rdf:about="https://b.hatena.ne.jp/entry/s/cefboud.com/posts/compression/">
<title>&#x306F;&#x3066;&#x306A;&#x30D6;&#x30C3;&#x30AF;&#x30DE;&#x30FC;&#x30AF; - Taking a Look at Compression Algorithms</title>
<link>https://b.hatena.ne.jp/entry/s/cefboud.com/posts/compression/</link>
<description># In order of most to least frequent: B, A, C, D. B, the most frequent, has the shorter code, thus allowing for the maximum space saving. /\ Symbol Code 0 1 ------ ---- / \ A 00 /\ B B 1 0 1 C 011 ...</description>
<items>
 <rdf:Seq>
  <rdf:li rdf:resource="https://b.hatena.ne.jp/xef/20250124#bookmark-4765254254708837760" />
  <rdf:li rdf:resource="https://b.hatena.ne.jp/barlog/20250124#bookmark-4765254254708837760" />
 </rdf:Seq>
</items>
</channel>
<item rdf:about="https://b.hatena.ne.jp/xef/20250124#bookmark-4765254254708837760">
<title>xef</title>
<link>https://b.hatena.ne.jp/xef/20250124#bookmark-4765254254708837760</link>
<description></description>
<dc:date>2025-01-24T13:47:51Z</dc:date>
<dc:subject>compression</dc:subject>
<dc:subject>Algorithm</dc:subject>
<taxo:topics>
  <rdf:Bag>
    <rdf:li resource="https://b.hatena.ne.jp/q/compression" />
    <rdf:li resource="https://b.hatena.ne.jp/q/Algorithm" />
  </rdf:Bag>
</taxo:topics>
</item>
<item rdf:about="https://b.hatena.ne.jp/barlog/20250124#bookmark-4765254254708837760">
<title>barlog</title>
<link>https://b.hatena.ne.jp/barlog/20250124#bookmark-4765254254708837760</link>
<description></description>
<dc:date>2025-01-23T16:25:30Z</dc:date>
</item>
</rdf:RDF>