🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:
Response:
Calculated Shard: 18 (from laksa151)

2. Crawled Status Check

Query:
Response:

3. Robots.txt Check

Query:
Response:

4. Spam/Ban Check

Query:
Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📄
INDEXABLE
CRAWLED
8 days ago
🤖
ROBOTS ALLOWED

Page Info Filters

FilterStatusConditionDetails
HTTP statusPASSdownload_http_code = 200HTTP 200
Age cutoffPASSdownload_stamp > now() - 6 MONTH0.3 months ago
History dropPASSisNull(history_drop_reason)No drop reason
Spam/banPASSfh_dont_index != 1 AND ml_spam_score = 0ml_spam_score=0
CanonicalPASSmeta_canonical IS NULL OR = '' OR = src_unparsedNot set

Page Details

PropertyValue
URLhttps://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life
Last Crawled2026-04-02 19:17:45 (8 days ago)
First Indexed2015-08-02 00:26:48 (10 years ago)
HTTP Status Code200
Meta Titlecoding theory - Error-correcting codes used in real life - Mathematics Stack Exchange
Meta Descriptionnull
Meta Canonicalnull
Boilerpipe Text
Example in practice: In European Railway Business (Signalling) we have to follow specific Safety Standards (according to CENELEC). An important aspect is the data transfer in closed transmission systems. One out of many techniques/measurements to avoid failures resp. detect failures in order to mitigate consequences is the usage of CRC codes . The challenge was to find CRC codes which are with respect to their error detection properties appropriate for the specific application and which also follow the requirements of the Standard (EN 50159-1) , namely to be a proper resp. good CRC code. Note: A CRC code is proper if the undetected error probability P u d ( C , ε ) of the Code is an increasing function of the bit-error probability ε for ε ∈ [ 0 , 1 2 ] . It can therefore be estimated by P u d ( C , ε ) ≤ P u d ( C , 1 2 ) which makes it suitable for further calculations. Goodness of a CRC is a somewhat weaker property. Some important aspects: Message data length : The block length of the input data on which the CRC is calculated is crucial for the quality of the error detection capabilities. It turns out that the minimum Hammingdistance d m i n ( n ) of data with block length n should be maximised (see e.g. Optimum Cyclic Redundancy-Check Codes with 16-Bit Redundancy (1990) from Castagnoli etal. Properness, Goodness : are properties of the CRC code which are also dependent on the message data length Usage of Standard CRCs is not always the best choice . Some CRCs were designed for a specific usage and therefore appropriate for a small range of applications only. The internet community has sometimes adopted such a CRC and so it became a standard or de facto standard . Research starting in the 90 s has revealed some better alternatives. This was also possible due to the increasing computer power. See e.g. the paper Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy (2000) from Baicheva, etal. Koopman presented some interesting papers (e.g. Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks (2004) . Here's a nice tutorial Techniques for aviation from Koopman ( 2012 ) regarding this theme. Note: In fact we've studied many papers (and other sources) in order to make finally a suitable choice. Note: Some time ago I've posted a different checksum problem . But, maybe it's too simple and not the type of cryptographic info you are looking for.
Markdown
# ![site logo](https://stackoverflow.com/Content/Img/SE-logo75.png) By clicking “Sign up”, you agree to our [terms of service](https://math.stackexchange.com/legal/terms-of-service/public) and acknowledge you have read our [privacy policy](https://math.stackexchange.com/legal/privacy-policy). # OR Already have an account? [Log in](https://math.stackexchange.com/users/login) [Skip to main content](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life#content) #### Stack Exchange Network Stack Exchange network consists of 183 Q\&A communities including [Stack Overflow](https://stackoverflow.com/), the largest, most trusted online community for developers to learn, share their knowledge, and build their careers. [Visit Stack Exchange](https://stackexchange.com/) 1. - [Tour Start here for a quick overview of the site](https://math.stackexchange.com/tour) - [Help Center Detailed answers to any questions you might have](https://math.stackexchange.com/help) - [Meta Discuss the workings and policies of this site](https://math.meta.stackexchange.com/) - [About Us Learn more about Stack Overflow the company, and our products](https://stackoverflow.co/) 2. ### [current community](https://math.stackexchange.com/) - [Mathematics](https://math.stackexchange.com/) [help](https://math.stackexchange.com/help) [chat](https://chat.stackexchange.com/?tab=site&host=math.stackexchange.com) - [Mathematics Meta](https://math.meta.stackexchange.com/) ### your communities [Sign up](https://math.stackexchange.com/users/signup?ssrc=site_switcher&returnurl=https%3A%2F%2Fmath.stackexchange.com%2Fquestions%2F974228%2Ferror-correcting-codes-used-in-real-life) or [log in](https://math.stackexchange.com/users/login?ssrc=site_switcher&returnurl=https%3A%2F%2Fmath.stackexchange.com%2Fquestions%2F974228%2Ferror-correcting-codes-used-in-real-life) to customize your list. ### [more stack exchange communities](https://stackexchange.com/sites) [company blog](https://stackoverflow.blog/) 3. [Log in](https://math.stackexchange.com/users/login?ssrc=head&returnurl=https%3A%2F%2Fmath.stackexchange.com%2Fquestions%2F974228%2Ferror-correcting-codes-used-in-real-life) 4. [Sign up](https://math.stackexchange.com/users/signup?ssrc=head&returnurl=https%3A%2F%2Fmath.stackexchange.com%2Fquestions%2F974228%2Ferror-correcting-codes-used-in-real-life) [![Mathematics](https://math.stackexchange.com/Content/Sites/math/Img/logo.svg?v=4a36350d1199)](https://math.stackexchange.com/) 1. 1. [Home](https://math.stackexchange.com/) 2. [Questions](https://math.stackexchange.com/questions) 3. [Unanswered](https://math.stackexchange.com/unanswered) 4. [AI Assist](https://stackoverflow.com/ai-assist) 5. [Tags](https://math.stackexchange.com/tags) 6. [Chat](https://chat.stackexchange.com/) 7. [Users](https://math.stackexchange.com/users) 2. Stack Internal Stack Overflow for Teams is now called **Stack Internal**. Bring the best of human thought and AI automation together at your work. [Try for free](https://stackoverflowteams.com/teams/create/free/?utm_medium=referral&utm_source=math-community&utm_campaign=side-bar&utm_content=explore-teams) [Learn more](https://stackoverflow.co/internal/?utm_medium=referral&utm_source=math-community&utm_campaign=side-bar&utm_content=explore-teams) 3. [Stack Internal]() 4. Bring the best of human thought and AI automation together at your work. [Learn more](https://stackoverflow.co/internal/?utm_medium=referral&utm_source=math-community&utm_campaign=side-bar&utm_content=explore-teams-compact) **Stack Internal** Knowledge at work Bring the best of human thought and AI automation together at your work. [Explore Stack Internal](https://stackoverflow.co/internal/?utm_medium=referral&utm_source=math-community&utm_campaign=side-bar&utm_content=explore-teams-compact-popover) # [Error-correcting codes used in real life](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life) [Ask Question](https://math.stackexchange.com/questions/ask) Asked 11 years, 5 months ago Modified [11 years, 4 months ago](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life?lastactivity "2014-12-01 18:47:56Z") Viewed 5k times This question shows research effort; it is useful and clear 15 Save this question. Show activity on this post. I am very interested in coding theory and I wonder if there is a particular kind of codes used in practice. For example I read that Reed-Solomon codes are often used for encoding data on a compact disc. In particular I would like to know which kind of code is mostly used in real life and in which contest. I know that it is not a specific question but I'm really curious to know how coding theory is used in current technology. Moreover I'm also interested in knowing which is more or less the usual length of a code used in practice. Thanks a lot for the answer - [coding-theory](https://math.stackexchange.com/questions/tagged/coding-theory "show questions tagged 'coding-theory'") - [applications](https://math.stackexchange.com/questions/tagged/applications "show questions tagged 'applications'") [Share](https://math.stackexchange.com/q/974228 "Short permalink to this question") Share a link to this question Copy link [CC BY-SA 3.0](https://creativecommons.org/licenses/by-sa/3.0/ "The current license for this post: CC BY-SA 3.0") Cite Follow Follow this question to receive notifications [edited Oct 15, 2014 at 0:57](https://math.stackexchange.com/posts/974228/revisions "show all edits to this post") [![Git Gud's user avatar](https://i.sstatic.net/C2ij9.jpg?s=64)](https://math.stackexchange.com/users/55235/git-gud) [Git Gud](https://math.stackexchange.com/users/55235/git-gud) 31\.8k1212 gold badges6767 silver badges127127 bronze badges asked Oct 15, 2014 at 0:54 [![Sfarla's user avatar](https://graph.facebook.com/1294403268/picture?type=large)](https://math.stackexchange.com/users/178341/sfarla) [Sfarla](https://math.stackexchange.com/users/178341/sfarla) 1,5771010 silver badges1616 bronze badges 2 - 1 Thanks for asking this! I always like seeing interesting applications of error correction. Hopefully others will post answers as well. Snowball – [Snowball](https://math.stackexchange.com/users/24875/snowball "3,148 reputation") 2014-10-15 03:42:30 +00:00 [Commented Oct 15, 2014 at 3:42](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life#comment1998218_974228) - 2 [The QuickResponse codes](http://en.wikipedia.org/wiki/QR_code) were not listed yet. They are just Reed-Solomon codes over GF(256) G F ( 256 ) , but have become popular lately because there are apps allowing smartphones to use them. As you see from Snowball's comprehensive list (and my old answer) wireless apps use either LDPC or Turbo codes (or when the blocks are quite short convolutional codes). That's because soft decoding is a must for those applications, and algebraic codes don't handle that very well. Algebra shows its power when soft information is not available. Jyrki Lahtonen – [Jyrki Lahtonen](https://math.stackexchange.com/users/11619/jyrki-lahtonen "143,533 reputation") 2014-10-24 19:59:59 +00:00 [Commented Oct 24, 2014 at 19:59](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life#comment2025513_974228) [Add a comment](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life "Use comments to ask for more information or suggest improvements. Avoid answering questions in comments.") \| ## 3 Answers 3 Sorted by: [Reset to default](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life?answertab=scoredesc#tab-top) This answer is useful 11 Save this answer. Show activity on this post. Here are a few: - The [10GBASE-T](https://en.wikipedia.org/wiki/10-gigabit_Ethernet#10GBASE-T) standard for 10 Gbit/s Ethernet over copper uses a \[2048,1723\]2 \[ 2048 , 1723 \] 2 LDPC code constructed from a generalized Reed-Solomon code. - [RAID 6](https://en.wikipedia.org/wiki/Standard_RAID_levels#RAID_6) implementations often use generalized Reed-Solomon codes to correct erasures caused by failed disks. I believe the Linux implementation of RAID 6 uses codes like \[n,k\]28 \[ n , k \] 2 8 where 0≤k\<n≤255 0 ≤ k \< n ≤ 255; typically something like k≈3 k ≈ 3 and n≈5 n ≈ 5. - The object storage system [Ceph](http://ceph.com/) supports a generalized Reed-Solomon code so that data is accessible even if several of the storage nodes are unavailable (erasure coding). I haven't looked into it carefully, but I believe the parameters are around the same order as those of RAID 6. - [Error correcting memory](https://en.wikipedia.org/wiki/ECC_memory) often uses a modified Hamming code. [According to](https://en.wikipedia.org/wiki/Hamming_code#SECDED) an unknown Wikipedia contributor, \[72,64\]2 \[ 72 , 64 \] 2 and \[127,120\]2 \[ 127 , 120 \] 2 are popular parameters. - The [McEliece cryptosystem](https://en.wikipedia.org/wiki/McEliece_cryptosystem) is based on a \[1632,1269,69\]2 \[ 1632 , 1269 , 69 \] 2 Goppa code. Supposedly this cryptosystem is a candidate for post-quantum cryptography (cryptography that isn't broken by quantum computers). - [ITU OTN](https://en.wikipedia.org/wiki/G.709) uses a \[255,239\]28 \[ 255 , 239 \] 2 8 Reed-Solomon code for error correction on fiber optic networks. - In machine learning, BCH and (more commonly) 1-of-n codes are used to implement [non-binary classification](http://www.jair.org/media/105/live-105-1426-jair.pdf) of data using a [support vector machine](https://en.wikipedia.org/wiki/Support_vector_machine). There's a wide range of parameters here depending on the application, but I'd estimate it's typically around length 10-1000. - In cryptography, [Shamir's secret sharing](https://en.wikipedia.org/wiki/Shamir%27s_Secret_Sharing) scheme is a [special case of Reed-Solomon erasure coding](https://crypto.stackexchange.com/questions/1760/rs-erasure-coding-and-shamirs-secret-sharing). I don't know what secret sharing is typically used for, so I don't know what the typical parameters would be. See also [Jyrki's answer](https://math.stackexchange.com/a/218999/24875) to my question from a while back. He covers several telecommunications applications and their typical parameters. [Share](https://math.stackexchange.com/a/974376 "Short permalink to this answer") Share a link to this answer Copy link [CC BY-SA 3.0](https://creativecommons.org/licenses/by-sa/3.0/ "The current license for this post: CC BY-SA 3.0") Cite Follow Follow this answer to receive notifications [edited Apr 13, 2017 at 12:21](https://math.stackexchange.com/posts/974376/revisions "show all edits to this post") [![Community's user avatar](https://www.gravatar.com/avatar/a007be5a61f6aa8f3e85ae2fc18dd66e?s=64&d=identicon&r=PG)](https://math.stackexchange.com/users/-1/community) [Community](https://math.stackexchange.com/users/-1/community)Bot 1 answered Oct 15, 2014 at 3:33 [![Snowball's user avatar](https://www.gravatar.com/avatar/dbb836e68f5c381e368e48ffb89381b1?s=64&d=identicon&r=PG)](https://math.stackexchange.com/users/24875/snowball) [Snowball](https://math.stackexchange.com/users/24875/snowball) 3,1482121 silver badges3939 bronze badges [Add a comment](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life "Use comments to ask for more information or suggest improvements. Avoid comments like “+1” or “thanks”.") \| This answer is useful 5 Save this answer. \+100 This answer has been awarded bounties worth 100 reputation by Snowball Show activity on this post. *Example in practice:* In European Railway Business (Signalling) we have to follow specific Safety Standards (according to CENELEC). An important aspect is the data transfer in closed transmission systems. One out of many techniques/measurements to avoid failures resp. detect failures in order to mitigate consequences is the *usage of CRC codes*. > The challenge was to find CRC codes which are with respect to their error detection properties *appropriate for the specific application* and which also follow the *requirements of the Standard (EN 50159-1)*, namely to be a *proper* resp. *good* CRC code. *Note:* A CRC code is *proper* if the undetected error probability Pud(C,ε) P u d ( C , ε ) of the Code is an increasing function of the *bit-error probability* ε ε for ε∈\[0,12\] ε ∈ \[ 0 , 1 2 \]. It can therefore be estimated by Pud(C,ε)≤Pud(C,12) P u d ( C , ε ) ≤ P u d ( C , 1 2 ) which makes it suitable for further calculations. *Goodness* of a CRC is a somewhat weaker property. > *Some important aspects:* > > - *Message data length*: The block length of the input data on which the CRC is calculated is crucial for the quality of the error detection capabilities. It turns out that the *minimum Hammingdistance* dmin(n) d m i n ( n ) of data with block length n n should be maximised (see e.g. [Optimum Cyclic Redundancy-Check Codes with 16-Bit Redundancy (1990)](http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=46536) from Castagnoli etal. > - *Properness, Goodness*: are properties of the CRC code which are also dependent on the message data length > - Usage of *Standard* CRCs is **not always the best choice**. > > Some CRCs were designed for a specific usage and therefore appropriate for a small range of applications only. The internet community has sometimes adopted such a CRC and so it became a standard or *de facto standard*. Research starting in the 90 90s has revealed some better alternatives. This was also possible due to the increasing computer power. See e.g. the paper [Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy (2000)](http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=879758) from Baicheva, etal. > > *Koopman* presented some interesting papers (e.g. [Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks (2004)](http://users.ece.cmu.edu/~koopman/roses/dsn04/koopman04_crc_poly_embedded.pdf). > > Here's a nice tutorial [Techniques for aviation](http://users.ece.cmu.edu/~koopman/pubs/KoopmanCRCWebinar9May2012.pdf) from Koopman (2012 2012) regarding this theme. *Note:* In fact we've studied *many* papers (and other sources) in order to make finally a suitable choice. *** *Note:* Some time ago I've posted a [*different checksum* problem](https://math.stackexchange.com/questions/693366/number-of-binary-m-times-n-matrices-with-even-row-sums-even-col-sums-and-k). But, maybe it's too simple and not the type of cryptographic info you are looking for. [Share](https://math.stackexchange.com/a/1046928 "Short permalink to this answer") Share a link to this answer Copy link [CC BY-SA 3.0](https://creativecommons.org/licenses/by-sa/3.0/ "The current license for this post: CC BY-SA 3.0") Cite Follow Follow this answer to receive notifications [edited Jun 12, 2020 at 10:38](https://math.stackexchange.com/posts/1046928/revisions "show all edits to this post") [![Community's user avatar](https://www.gravatar.com/avatar/a007be5a61f6aa8f3e85ae2fc18dd66e?s=64&d=identicon&r=PG)](https://math.stackexchange.com/users/-1/community) [Community](https://math.stackexchange.com/users/-1/community)Bot 1 answered Dec 1, 2014 at 18:41 [![Markus Scheuer's user avatar](https://i.sstatic.net/Aq7IJ.png?s=64)](https://math.stackexchange.com/users/132007/markus-scheuer) [Markus Scheuer](https://math.stackexchange.com/users/132007/markus-scheuer) 113k77 gold badges110110 silver badges254254 bronze badges 1 - @Snowball: Hi, Snowball! Thanks for granting the bounty! :-) Markus Scheuer – [Markus Scheuer](https://math.stackexchange.com/users/132007/markus-scheuer "113,270 reputation") 2014-12-06 07:09:11 +00:00 [Commented Dec 6, 2014 at 7:09](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life#comment2145928_1046928) [Add a comment](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life "Use comments to ask for more information or suggest improvements. Avoid comments like “+1” or “thanks”.") \| This answer is useful 3 Save this answer. Show activity on this post. To give a *totally* different example, codes have also been used for betting systems that guarantee at least one bet with many matches while placing relatively few bets [Share](https://math.stackexchange.com/a/1046942 "Short permalink to this answer") Share a link to this answer Copy link [CC BY-SA 3.0](https://creativecommons.org/licenses/by-sa/3.0/ "The current license for this post: CC BY-SA 3.0") Cite Follow Follow this answer to receive notifications answered Dec 1, 2014 at 18:47 [![Hagen von Eitzen's user avatar](https://i.sstatic.net/hnO1y.jpg?s=64)](https://math.stackexchange.com/users/39174/hagen-von-eitzen) [Hagen von Eitzen](https://math.stackexchange.com/users/39174/hagen-von-eitzen) 386k3333 gold badges386386 silver badges692692 bronze badges [Add a comment](https://math.stackexchange.com/questions/974228/error-correcting-codes-used-in-real-life "Use comments to ask for more information or suggest improvements. Avoid comments like “+1” or “thanks”.") \| ## You must [log in](https://math.stackexchange.com/users/login?ssrc=question_page&returnurl=https%3A%2F%2Fmath.stackexchange.com%2Fquestions%2F974228) to answer this question. Start asking to get answers Find the answer to your question by asking. [Ask question](https://math.stackexchange.com/questions/ask) Explore related questions - [coding-theory](https://math.stackexchange.com/questions/tagged/coding-theory "show questions tagged 'coding-theory'") - [applications](https://math.stackexchange.com/questions/tagged/applications "show questions tagged 'applications'") See similar questions with these tags. #### Linked [22](https://math.stackexchange.com/questions/215938/has-error-correction-been-solved?lq=1 "Question score (upvotes - downvotes)") [Has error correction been "solved"?](https://math.stackexchange.com/questions/215938/has-error-correction-been-solved?noredirect=1&lq=1) [9](https://math.stackexchange.com/questions/693366/number-of-binary-m-times-n-matrices-with-even-row-sums-even-col-sums-and-k?lq=1 "Question score (upvotes - downvotes)") [Number of binary M×N M × N matrices with even row sums, even col sums and K K ones, K K even](https://math.stackexchange.com/questions/693366/number-of-binary-m-times-n-matrices-with-even-row-sums-even-col-sums-and-k?noredirect=1&lq=1) [1](https://math.stackexchange.com/questions/1422288/what-is-a-good-theoretical-yet-somewhat-practical-book-about-error-correction?lq=1 "Question score (upvotes - downvotes)") [What is a good theoretical, yet somewhat practical, book about error correction codes?](https://math.stackexchange.com/questions/1422288/what-is-a-good-theoretical-yet-somewhat-practical-book-about-error-correction?noredirect=1&lq=1) #### Related [1](https://math.stackexchange.com/questions/1046982/error-correcting-codes-for-asymmetric-channels?rq=1 "Question score (upvotes - downvotes)") [Error correcting codes for asymmetric channels](https://math.stackexchange.com/questions/1046982/error-correcting-codes-for-asymmetric-channels?rq=1) [1](https://math.stackexchange.com/questions/1329733/application-of-reed-solomon-codes?rq=1 "Question score (upvotes - downvotes)") [Application of Reed Solomon codes](https://math.stackexchange.com/questions/1329733/application-of-reed-solomon-codes?rq=1) [0](https://math.stackexchange.com/questions/1398594/reed-solomon-encoding?rq=1 "Question score (upvotes - downvotes)") [Reed Solomon Encoding](https://math.stackexchange.com/questions/1398594/reed-solomon-encoding?rq=1) [0](https://math.stackexchange.com/questions/2174159/why-should-a-reed-solomon-code-be-a-narrow-sense-bch-code?rq=1 "Question score (upvotes - downvotes)") [Why should a Reed Solomon code be a 'narrow sense' BCH -code?](https://math.stackexchange.com/questions/2174159/why-should-a-reed-solomon-code-be-a-narrow-sense-bch-code?rq=1) [0](https://math.stackexchange.com/questions/2749344/what-are-the-restrictions-on-the-number-of-error-corrections-in-reed-solomon-cod?rq=1 "Question score (upvotes - downvotes)") [What are the restrictions on the number of error corrections in Reed-Solomon codes?](https://math.stackexchange.com/questions/2749344/what-are-the-restrictions-on-the-number-of-error-corrections-in-reed-solomon-cod?rq=1) [0](https://math.stackexchange.com/questions/3853401/proving-reed-solomon-codes-are-linear?rq=1 "Question score (upvotes - downvotes)") [Proving reed solomon codes are linear](https://math.stackexchange.com/questions/3853401/proving-reed-solomon-codes-are-linear?rq=1) [0](https://math.stackexchange.com/questions/3975583/is-there-an-error-correcting-code-for-bits-expressed-in-3-d?rq=1 "Question score (upvotes - downvotes)") [Is there an error-correcting code for bits expressed in 3-D?](https://math.stackexchange.com/questions/3975583/is-there-an-error-correcting-code-for-bits-expressed-in-3-d?rq=1) [0](https://math.stackexchange.com/questions/4030181/what-would-be-a-good-error-correction-code-for-recovering-from-50-data-corrupti?rq=1 "Question score (upvotes - downvotes)") [What would be a good error correction code for recovering from 50% data corruption?](https://math.stackexchange.com/questions/4030181/what-would-be-a-good-error-correction-code-for-recovering-from-50-data-corrupti?rq=1) [1](https://math.stackexchange.com/questions/4053891/what-is-so-special-about-the-generator-chosen-for-reed-solomon-codes?rq=1 "Question score (upvotes - downvotes)") [What is so special about the generator chosen for Reed solomon Codes?](https://math.stackexchange.com/questions/4053891/what-is-so-special-about-the-generator-chosen-for-reed-solomon-codes?rq=1) [1](https://math.stackexchange.com/questions/4637611/largest-number-of-shards-for-linear-erasure-codes-over-a-finite-field?rq=1 "Question score (upvotes - downvotes)") [Largest number of shards for linear erasure codes over a finite field](https://math.stackexchange.com/questions/4637611/largest-number-of-shards-for-linear-erasure-codes-over-a-finite-field?rq=1) #### [Hot Network Questions](https://stackexchange.com/questions?tab=hot) - [Examples of not obvious matrix rings](https://math.stackexchange.com/questions/5131167/examples-of-not-obvious-matrix-rings) - [What is this pen-like mouse-like device that connects to a probably-computer via a connector I dunno what it is?](https://superuser.com/questions/1936355/what-is-this-pen-like-mouse-like-device-that-connects-to-a-probably-computer-via) - [Is sampling a signal with 2-channel ADC, where the second channel is delayed by 90° at sampling frequency actually I/Q sampling?](https://dsp.stackexchange.com/questions/99743/is-sampling-a-signal-with-2-channel-adc-where-the-second-channel-is-delayed-by) - [Designing a clamping circuit / clipper for a piezoelectric disk going into an ADC](https://electronics.stackexchange.com/questions/767643/designing-a-clamping-circuit-clipper-for-a-piezoelectric-disk-going-into-an-ad) - [Convergence of a series defined by an iterative recurrence on sequences](https://mathoverflow.net/questions/509775/convergence-of-a-series-defined-by-an-iterative-recurrence-on-sequences) - [Why is my breaker tripping after changing an outlet?](https://diy.stackexchange.com/questions/329798/why-is-my-breaker-tripping-after-changing-an-outlet) - [The Emperor’s Command: All Roads Lead to Rome](https://puzzling.stackexchange.com/questions/137539/the-emperor-s-command-all-roads-lead-to-rome) - [How can I accurately calculate compound interest without using Excel?](https://money.stackexchange.com/questions/169453/how-can-i-accurately-calculate-compound-interest-without-using-excel) - [Separated Numbers](https://puzzling.stackexchange.com/questions/137570/separated-numbers) - [What is a deterministic way to unfuse this quill stem?](https://bicycles.stackexchange.com/questions/100134/what-is-a-deterministic-way-to-unfuse-this-quill-stem) - [What is the Significance of Jesus mentioning Three Different books?](https://hermeneutics.stackexchange.com/questions/115620/what-is-the-significance-of-jesus-mentioning-three-different-books) - [Help with Drum notation](https://music.stackexchange.com/questions/143442/help-with-drum-notation) - [How would contemporary physicalist philosophers respond to Abhinavagupta’s critique of the materialist accounts of causality?](https://philosophy.stackexchange.com/questions/137439/how-would-contemporary-physicalist-philosophers-respond-to-abhinavagupta-s-criti) - [Typical examples of representations of Kac-Moody algebras](https://mathoverflow.net/questions/509772/typical-examples-of-representations-of-kac-moody-algebras) - [Parent push bike where the pedals move WITH the wheels](https://bicycles.stackexchange.com/questions/100129/parent-push-bike-where-the-pedals-move-with-the-wheels) - [Blender Glare Nodes](https://blender.stackexchange.com/questions/346030/blender-glare-nodes) - [What should I do when my residuals aren't normally distributed for a mediation analysis?](https://stats.stackexchange.com/questions/675442/what-should-i-do-when-my-residuals-arent-normally-distributed-for-a-mediation-a) - [Why didn't God lead the Israelites out of Egypt same way Moses came in over the Peninsula](https://hermeneutics.stackexchange.com/questions/115657/why-didnt-god-lead-the-israelites-out-of-egypt-same-way-moses-came-in-over-the) - [Why is a permutation matrix stochastic and unitary?](https://math.stackexchange.com/questions/5131212/why-is-a-permutation-matrix-stochastic-and-unitary) - [The area of a rectangle containing a curved line of a known length](https://math.stackexchange.com/questions/5130987/the-area-of-a-rectangle-containing-a-curved-line-of-a-known-length) - [How to colorized any line drawed with draw (nor with plot expression)?](https://tex.stackexchange.com/questions/761483/how-to-colorized-any-line-drawed-with-draw-nor-with-plot-expression) - [Using GenAI for PhD Research: Productivity vs Enjoyment](https://academia.stackexchange.com/questions/226350/using-genai-for-phd-research-productivity-vs-enjoyment) - [Can this be done? Split Pascal's triangle (without the 1's) into two connected regions of equal sums.](https://math.stackexchange.com/questions/5131253/can-this-be-done-split-pascals-triangle-without-the-1s-into-two-connected-r) - [What's this cloverleaf / 3-lobed shape in the heel of this Artemis astronaut's shoe?](https://space.stackexchange.com/questions/70393/whats-this-cloverleaf-3-lobed-shape-in-the-heel-of-this-artemis-astronauts-s) [Question feed](https://math.stackexchange.com/feeds/question/974228 "Feed of this question and its answers") # Subscribe to RSS Question feed To subscribe to this RSS feed, copy and paste this URL into your RSS reader. ![](https://math.stackexchange.com/posts/974228/ivc/d019?prg=ce69f2b2-8f07-42cd-8927-cd59c9758961) # Why are you flagging this comment? It contains harassment, bigotry or abuse. This comment attacks a person or group. Learn more in our [Abusive behavior policy](https://math.stackexchange.com/conduct/abusive-behavior). It's unfriendly or unkind. This comment is rude or condescending. Learn more in our [Code of Conduct](https://math.stackexchange.com/conduct/abusive-behavior). Not needed. This comment is not relevant to the post. ``` ``` Enter at least 6 characters Something else. A problem not listed above. Try to be as specific as possible. ``` ``` Enter at least 6 characters Flag comment Cancel You have 0 flags left today # ![Illustration of upvote icon after it is clicked](https://math.stackexchange.com/Content/Img/modal/img-upvote.png?v=fce73bd9724d) # Hang on, you can't upvote just yet. You'll need to complete a few actions and gain 15 reputation points before being able to upvote. **Upvoting** indicates when questions and answers are useful. [What's reputation and how do I get it?](https://stackoverflow.com/help/whats-reputation) Instead, you can save this post to reference later. Save this post for later Not now ##### [Mathematics](https://math.stackexchange.com/) - [Tour](https://math.stackexchange.com/tour) - [Help](https://math.stackexchange.com/help) - [Chat](https://chat.stackexchange.com/?tab=site&host=math.stackexchange.com) - [Contact](https://math.stackexchange.com/contact) - [Feedback](https://math.meta.stackexchange.com/) ##### [Company](https://stackoverflow.co/) - [Stack Overflow](https://stackoverflow.com/) - [Stack Internal](https://stackoverflow.co/internal/) - [Stack Data Licensing](https://stackoverflow.co/data-licensing/) - [Stack Ads](https://stackoverflow.co/advertising/) - [About](https://stackoverflow.co/) - [Press](https://stackoverflow.co/company/press/) - [Legal](https://stackoverflow.com/legal) - [Privacy Policy](https://stackoverflow.com/legal/privacy-policy) - [Terms of Service](https://stackoverflow.com/legal/terms-of-service/public) - Cookie Settings - [Cookie Policy](https://policies.stackoverflow.co/stack-overflow/cookie-policy) ##### [Stack Exchange Network](https://stackexchange.com/) - [Technology](https://stackexchange.com/sites#technology) - [Culture & recreation](https://stackexchange.com/sites#culturerecreation) - [Life & arts](https://stackexchange.com/sites#lifearts) - [Science](https://stackexchange.com/sites#science) - [Professional](https://stackexchange.com/sites#professional) - [Business](https://stackexchange.com/sites#business) - [API](https://api.stackexchange.com/) - [Data](https://data.stackexchange.com/) - [Blog](https://stackoverflow.blog/?blb=1) - [Facebook](https://www.facebook.com/officialstackoverflow/) - [Twitter](https://twitter.com/stackoverflow) - [LinkedIn](https://linkedin.com/company/stack-overflow) - [Instagram](https://www.instagram.com/thestackoverflow) Site design / logo © 2026 Stack Exchange Inc; user contributions licensed under [CC BY-SA](https://stackoverflow.com/help/licensing) . rev 2026.4.2.41748
Readable Markdown
*Example in practice:* In European Railway Business (Signalling) we have to follow specific Safety Standards (according to CENELEC). An important aspect is the data transfer in closed transmission systems. One out of many techniques/measurements to avoid failures resp. detect failures in order to mitigate consequences is the *usage of CRC codes*. > The challenge was to find CRC codes which are with respect to their error detection properties *appropriate for the specific application* and which also follow the *requirements of the Standard (EN 50159-1)*, namely to be a *proper* resp. *good* CRC code. *Note:* A CRC code is *proper* if the undetected error probability P u d ( C , ε ) of the Code is an increasing function of the *bit-error probability* ε for ε ∈ \[ 0 , 1 2 \]. It can therefore be estimated by P u d ( C , ε ) ≤ P u d ( C , 1 2 ) which makes it suitable for further calculations. *Goodness* of a CRC is a somewhat weaker property. > *Some important aspects:* > > - *Message data length*: The block length of the input data on which the CRC is calculated is crucial for the quality of the error detection capabilities. It turns out that the *minimum Hammingdistance* d m i n ( n ) of data with block length n should be maximised (see e.g. [Optimum Cyclic Redundancy-Check Codes with 16-Bit Redundancy (1990)](http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=46536) from Castagnoli etal. > - *Properness, Goodness*: are properties of the CRC code which are also dependent on the message data length > - Usage of *Standard* CRCs is **not always the best choice**. > > Some CRCs were designed for a specific usage and therefore appropriate for a small range of applications only. The internet community has sometimes adopted such a CRC and so it became a standard or *de facto standard*. Research starting in the 90s has revealed some better alternatives. This was also possible due to the increasing computer power. See e.g. the paper [Undetected error probability performance of cyclic redundancy-check codes of 16-bit redundancy (2000)](http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=879758) from Baicheva, etal. > > *Koopman* presented some interesting papers (e.g. [Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks (2004)](http://users.ece.cmu.edu/~koopman/roses/dsn04/koopman04_crc_poly_embedded.pdf). > > Here's a nice tutorial [Techniques for aviation](http://users.ece.cmu.edu/~koopman/pubs/KoopmanCRCWebinar9May2012.pdf) from Koopman (2012) regarding this theme. *Note:* In fact we've studied *many* papers (and other sources) in order to make finally a suitable choice. *** *Note:* Some time ago I've posted a [*different checksum* problem](https://math.stackexchange.com/questions/693366/number-of-binary-m-times-n-matrices-with-even-row-sums-even-col-sums-and-k). But, maybe it's too simple and not the type of cryptographic info you are looking for.
Shard18 (laksa)
Root Hash8045678284012640218
Unparsed URLcom,stackexchange!math,/questions/974228/error-correcting-codes-used-in-real-life s443