[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6NVE39J1MVTMBRFXV2H39QJ":3,"skill-same:01M6NVE39J1MVTMBRFXV2H39QJ":59},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":30,"linkOnly":31,"markdownContent":32,"markdownBody":33,"frontMatter":34,"refName":37,"commitSha":38,"skillDirectory":39,"forksCount":14,"repositoryHtmlUrl":40,"repositoryHomepageUrl":6,"ownerHtmlUrl":41,"ownerBlogUrl":42,"ownerDescription":43,"updatedAt":44,"install":45,"resources":58},"01M6NVE39J1MVTMBRFXV2H39QJ","source-coding",null,"Problem-solving strategies for source coding in information theory","rubicanjr\u002FFinCognis","rubicanjr","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F234912519?v=4","01M6NT156NND8J474G34SB3923","Rubi","01M6NT15B70RWXE1N3YV0BZY8A",0,"MIT","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fmath\u002Finformation-theory\u002Fsource-coding\u002FSKILL.md",[],[19,20,21,22,23,24,25,26,27,28,29],"coding","source","source coding","Bash","read","problem-solving","strategies","information theory","problem","information","for","2026-11-10 10:12:30",false,"---\nname: source-coding\ndescription: \"Problem-solving strategies for source coding in information theory\"\nallowed-tools: [Bash, Read]\n---\n\n# Source Coding\n\n## When to Use\n\nUse this skill when working on source-coding problems in information theory.\n\n## Decision Tree\n\n\n1. **Source Coding Theorem**\n   - Minimum average code length >= H(X)\n   - Achievable with optimal codes\n   - `z3_solve.py prove \"shannon_bound\"`\n\n2. **Huffman Coding**\n   - Optimal prefix-free code for known distribution\n   - Build tree: combine two least probable symbols\n   - Average length: H(X) \u003C= L \u003C H(X) + 1\n   - `sympy_compute.py simplify \"expected_code_length\"`\n\n3. **Kraft Inequality**\n   - For prefix-free code: sum 2^{-l_i} \u003C= 1\n   - Necessary and sufficient\n   - `z3_solve.py prove \"kraft_inequality\"`\n\n4. **Arithmetic Coding**\n   - Approaches entropy for any distribution\n   - Encodes entire message as interval [0,1)\n   - Practical for adaptive\u002Funknown distributions\n\n5. **Rate-Distortion Theory**\n   - Lossy compression: trade rate for distortion\n   - R(D) = min_{p(x_hat|x): E[d(X,X_hat)]\u003C=D} I(X;X_hat)\n   - Minimum rate to achieve distortion D\n   - `sympy_compute.py minimize \"I(X;X_hat)\" --constraint \"E[d] \u003C= D\"`\n\n\n## Tool Commands\n\n### Scipy_Huffman\n```bash\nuv run python -c \"print('Huffman codes for a=0.5, b=0.25, c=0.125, d=0.125: a=0, b=10, c=110, d=111')\"\n```\n\n### Sympy_Kraft\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py simplify \"2**(-l1) + 2**(-l2) + 2**(-l3) + 2**(-l4)\"\n```\n\n### Z3_Shannon_Bound\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"expected_length >= entropy\"\n```\n\n## Key Techniques\n\n*From indexed textbooks:*\n\n- [Elements of Information Theory] Elements of Information Theory -- Thomas M_ Cover & Joy A_ Thomas -- 2_, Auflage, New York, NY, 2012 -- Wiley-Interscience -- 9780470303153 -- 2fcfe3e8a16b3aeefeaf9429fcf9a513 -- Anna’s Archive. The Shannon–Fano–Elias coding procedure can also be applied to sequences of random variables. The key idea is to use the cumulative distribution function of the sequence, expressed to the appropriate accuracy, as a code for the sequence.\n- [Information theory, inference, and learning algorithms] A binary data sequence of length 10 000 transmitted over a binary symmetric channel with noise level f = 0:1. Dilbert image Copyright c Syndicate, Inc. The physical solution is to improve the physical characteristics of the commu- nication channel to reduce its error probability.\n- [Information theory, inference, and learning algorithms] Encoder Decoder t Noisy channel 6 r Whereas physical solutions give incremental channel improvements only at an ever-increasing cost, system solutions can turn noisy channels into reliable communication channels with the only cost being a computational requirement at the encoder and decoder. Coding theory is concerned with the creation of practical encoding and We now consider examples of encoding and decoding systems. What is the simplest way to add useful redundancy to a transmission?\n\n## Cognitive Tools Reference\n\nSee `.claude\u002Fskills\u002Fmath-mode\u002FSKILL.md` for full tool documentation.\n","# Source Coding\n\n## When to Use\n\nUse this skill when working on source-coding problems in information theory.\n\n## Decision Tree\n\n\n1. **Source Coding Theorem**\n   - Minimum average code length >= H(X)\n   - Achievable with optimal codes\n   - `z3_solve.py prove \"shannon_bound\"`\n\n2. **Huffman Coding**\n   - Optimal prefix-free code for known distribution\n   - Build tree: combine two least probable symbols\n   - Average length: H(X) \u003C= L \u003C H(X) + 1\n   - `sympy_compute.py simplify \"expected_code_length\"`\n\n3. **Kraft Inequality**\n   - For prefix-free code: sum 2^{-l_i} \u003C= 1\n   - Necessary and sufficient\n   - `z3_solve.py prove \"kraft_inequality\"`\n\n4. **Arithmetic Coding**\n   - Approaches entropy for any distribution\n   - Encodes entire message as interval [0,1)\n   - Practical for adaptive\u002Funknown distributions\n\n5. **Rate-Distortion Theory**\n   - Lossy compression: trade rate for distortion\n   - R(D) = min_{p(x_hat|x): E[d(X,X_hat)]\u003C=D} I(X;X_hat)\n   - Minimum rate to achieve distortion D\n   - `sympy_compute.py minimize \"I(X;X_hat)\" --constraint \"E[d] \u003C= D\"`\n\n\n## Tool Commands\n\n### Scipy_Huffman\n```bash\nuv run python -c \"print('Huffman codes for a=0.5, b=0.25, c=0.125, d=0.125: a=0, b=10, c=110, d=111')\"\n```\n\n### Sympy_Kraft\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py simplify \"2**(-l1) + 2**(-l2) + 2**(-l3) + 2**(-l4)\"\n```\n\n### Z3_Shannon_Bound\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"expected_length >= entropy\"\n```\n\n## Key Techniques\n\n*From indexed textbooks:*\n\n- [Elements of Information Theory] Elements of Information Theory -- Thomas M_ Cover & Joy A_ Thomas -- 2_, Auflage, New York, NY, 2012 -- Wiley-Interscience -- 9780470303153 -- 2fcfe3e8a16b3aeefeaf9429fcf9a513 -- Anna’s Archive. The Shannon–Fano–Elias coding procedure can also be applied to sequences of random variables. The key idea is to use the cumulative distribution function of the sequence, expressed to the appropriate accuracy, as a code for the sequence.\n- [Information theory, inference, and learning algorithms] A binary data sequence of length 10 000 transmitted over a binary symmetric channel with noise level f = 0:1. Dilbert image Copyright c Syndicate, Inc. The physical solution is to improve the physical characteristics of the commu- nication channel to reduce its error probability.\n- [Information theory, inference, and learning algorithms] Encoder Decoder t Noisy channel 6 r Whereas physical solutions give incremental channel improvements only at an ever-increasing cost, system solutions can turn noisy channels into reliable communication channels with the only cost being a computational requirement at the encoder and decoder. Coding theory is concerned with the creation of practical encoding and We now consider examples of encoding and decoding systems. What is the simplest way to add useful redundancy to a transmission?\n\n## Cognitive Tools Reference\n\nSee `.claude\u002Fskills\u002Fmath-mode\u002FSKILL.md` for full tool documentation.\n",{"name":5,"description":7,"allowed-tools":35},[22,36],"Read","main","70e1c350500ee750987420bbae48837afa906b7e","skills\u002Fmath\u002Finformation-theory\u002Fsource-coding","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis","https:\u002F\u002Fgithub.com\u002Frubicanjr","linktr.ee\u002Ffinanskodu","Industrial Engineer & CIO @FinansKodu. Architecting AI-driven financial agents and autonomous workflows. 🏗️ Building systems, not just prompts.","2026-06-09 13:50:15",{"source":8,"skillName":5,"commands":46,"prompt":56,"zipAvailable":57},[47,50,53],{"tool":48,"command":49},"npx","npx skills add rubicanjr\u002FFinCognis --skill source-coding",{"tool":51,"command":52},"bunx","bunx skills add rubicanjr\u002FFinCognis --skill source-coding",{"tool":54,"command":55},"pnpm","pnpm dlx skills add rubicanjr\u002FFinCognis --skill source-coding","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fmath\u002Finformation-theory\u002Fsource-coding\u002FSKILL.md",true,[],[60,81,90,109,138,157],{"skillNo":61,"name":62,"nameZh":6,"description":63,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":64,"categories":65,"keywords":71,"publishedAt":30},"01M6NWS9DAXJTADT4T5MB49X8W","workflow-router","Goal-based workflow orchestration - routes tasks to specialist agents based on user goals","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fworkflow-router\u002FSKILL.md",[66],{"categoryNo":67,"categoryName":68,"taxonomyType":69,"taxonomyTypeDesc":70},"01JBSEEDCAT000000000000023","Skill与智能体开发","SCENARIO","使用场景",[72,73,74,75,76,77,78,79,80],"workflow router","workflow","router","orchestration","goals","goal","user","workflow orchestration","tasks",{"skillNo":82,"name":83,"nameZh":6,"description":84,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":85,"categories":86,"keywords":87,"publishedAt":30},"01M6NWS3RETSC0SHP16HP66E14","wiring","Wiring Verification","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fwiring\u002FSKILL.md",[],[83,88,89],"verification","false",{"skillNo":91,"name":92,"nameZh":6,"description":93,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":94,"categories":95,"keywords":99,"publishedAt":30},"01M6NWS0XW9CVQZBDA1EGW0TWC","websocket-patterns","Connection management, room patterns, reconnection strategies, message buffering, and binary protocol design.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fwebsocket-patterns\u002Fskill.md",[96],{"categoryNo":97,"categoryName":98,"taxonomyType":69,"taxonomyTypeDesc":70},"01JBSEEDCAT000000000000015","视觉设计",[100,101,102,103,104,105,106,25,107,108],"websocket","patterns","websocket patterns","design","protocol","management","message","binary","connection",{"skillNo":110,"name":111,"nameZh":6,"description":112,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":113,"categories":114,"keywords":119,"publishedAt":30},"01M6NWRDQDX9ZNETAWRRMQWV52","visual-verdict","Screenshot comparison QA for frontend development. Takes a screenshot of the current implementation, scores it across multiple visual dimensions, and returns a structured PASS\u002FREVISE\u002FFAIL verdict with concrete fixes. Use when implementing UI from a design reference or verifying visual correctness.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fvisual-verdict\u002FSKILL.md",[115,118],{"categoryNo":116,"categoryName":117,"taxonomyType":69,"taxonomyTypeDesc":70},"01JBSEEDCAT000000000000009","前端开发",{"categoryNo":67,"categoryName":68,"taxonomyType":69,"taxonomyTypeDesc":70},[120,121,122,123,124,125,126,127,128,29,129,130,131,103,132,133,134,135,136,137],"visual","verdict","visual verdict","ui","across","revise","comparison","correctness","implementing","fixes","dimensions","frontend","development","qa","screenshot","returns","use","frontend development",{"skillNo":139,"name":140,"nameZh":6,"description":141,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":142,"categories":143,"keywords":144,"publishedAt":30},"01M6NWR8HSNRS7MNDK2J02QYMN","verification-loop","Comprehensive verification system covering build, types, lint, tests, security, and diff review before a PR.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fverification-loop\u002FSKILL.md",[],[145,146,88,147,148,149,150,151,152,153,154,155,156],"verification loop","loop","lint","review","security","pr","system","diff","build","tests","diff review","types",{"skillNo":158,"name":159,"nameZh":6,"description":160,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":161,"categories":162,"keywords":163,"publishedAt":30},"01M6NWR4HHSFR0VR5EXFRWA747","vector-db-patterns","Embedding strategies, ANN algorithms, hybrid search, RAG chunking strategies, and reranking for semantic search and retrieval.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fvector-db-patterns\u002Fskill.md",[],[164,165,166,167,101,168,169,170,171,25,172,173,174,175,176,29,177,178],"vector db patterns","vector db","db","vector","semantic search","search","embedding strategies","algorithms","chunking","semantic","retrieval","embedding","Hybrid Search","hybrid","rag"]