mathstodon.xyz is one of the many independent Mastodon servers you can use to participate in the fediverse.
A Mastodon instance for maths people. We have LaTeX rendering in the web interface!

Server stats:

2.8K
active users

#errorcorrectingcodes

0 posts0 participants0 posts today
Alex Nelson<p>Project idea: formalize error correcting codes in Mizar.</p><p>Error-correcting codes are a beautiful subject, mostly because they&#39;re linear algebra over finite fields (and linear algebra is beautiful).</p><p>But there are exceptional connections in the subject: the Golay code and the Leech lattice especially connect with disparate subjects.</p><p>To give one sense of connection, I gave Robert A Wilson&#39;s construction of the Leech lattice using the octonions as a &quot;milestone&quot;.</p><p><a href="https://mathstodon.xyz/tags/Mizar" class="mention hashtag" rel="tag">#<span>Mizar</span></a> <a href="https://mathstodon.xyz/tags/ProofAssistant" class="mention hashtag" rel="tag">#<span>ProofAssistant</span></a> <a href="https://mathstodon.xyz/tags/ErrorCorrectingCodes" class="mention hashtag" rel="tag">#<span>ErrorCorrectingCodes</span></a> <a href="https://mathstodon.xyz/tags/LeechLattice" class="mention hashtag" rel="tag">#<span>LeechLattice</span></a> <a href="https://mathstodon.xyz/tags/LinearAlgebra" class="mention hashtag" rel="tag">#<span>LinearAlgebra</span></a> <a href="https://mathstodon.xyz/tags/Octonions" class="mention hashtag" rel="tag">#<span>Octonions</span></a> <a href="https://mathstodon.xyz/tags/GolayCode" class="mention hashtag" rel="tag">#<span>GolayCode</span></a> </p><p><a href="https://thmprover.wordpress.com/2025/01/09/from-error-correcting-codes-to-the-leech-lattice/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">thmprover.wordpress.com/2025/0</span><span class="invisible">1/09/from-error-correcting-codes-to-the-leech-lattice/</span></a></p>
Matt Spike<p>Does anyone know of any analytic approximations for the relationship between the efficiency of either a) source/compression coding algorithms, b) channel/error-correction coding algos, or even c) rate-distortion curves *AND* their computational/Big-O complexity (time or space)? </p><p><a href="https://fediscience.org/tags/infoTheory" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>infoTheory</span></a> <a href="https://fediscience.org/tags/rateDistortion" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>rateDistortion</span></a> <a href="https://fediscience.org/tags/computationalComplexity" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>computationalComplexity</span></a> <a href="https://fediscience.org/tags/bigO" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>bigO</span></a> <a href="https://fediscience.org/tags/compression" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>compression</span></a> <a href="https://fediscience.org/tags/errorCorrectingCodes" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>errorCorrectingCodes</span></a> <a href="https://fediscience.org/tags/tractability" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>tractability</span></a> <a href="https://fediscience.org/tags/Shannon" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Shannon</span></a></p>