Timeline for Ternary error correction codes
Current License: CC BY-SA 4.0
21 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2020 at 14:53 | vote | accept | user2679290 | ||
Mar 25, 2020 at 22:01 | comment | added | Gerry Myerson | OK, but the length of that bitstring seems to be important. That is, the answer to your question seems to depend on just how long that bitstring is. | |
Mar 25, 2020 at 18:03 | history | edited | user2679290 | CC BY-SA 4.0 |
added 42 characters in body
|
Mar 25, 2020 at 18:01 | comment | added | user2679290 | Sorry, I wanted to update my comment saying it was GF field not a long time ago by mistake. Had a timeout. The function f returns bitstring. Sorry for that. | |
Mar 25, 2020 at 4:58 | answer | added | kodlu | timeline score: 4 | |
Mar 25, 2020 at 4:57 | comment | added | Gerry Myerson | @Mark, I don't know what exactly OP has in mind for $f$, but nothing OP has written leads me to think its output is meant to be of length $m$. Maybe it's some kind of parity check, and its output is a single bit. | |
Mar 25, 2020 at 4:28 | comment | added | user6976 | The function $f$ is not defined. I guess it is any function of two variables where the input is a pair of binary words of length $m$ and the output is a binary word of length $m$. So the code words have lengths $6m$, the first half of a word is an arbitrary binary word of length $3m$ and the second half depends on $f$ and is for error checking. Then everything depends on $f$. For example if $f$ is a constant function, then the second halfs of the code words are the same and the usefulness of this code is doubtful. In general, using so many bits for error correcting seems excessive. | |
Mar 25, 2020 at 3:36 | comment | added | user6976 | $x. y, z$ were not bitstrings a little while ago. | |
Mar 25, 2020 at 3:17 | comment | added | Bill Bradley | This is an interesting question, but the choice of "ternary" seems unfortunate-- there's a already a whole literature on ternary ECCs, where "ternary" means "base-3". Your codes are binary with special structure. | |
Mar 25, 2020 at 2:37 | comment | added | user2679290 | x, y, z are bitstrings of length m. Concatenation makes sense. | |
Mar 25, 2020 at 2:34 | history | edited | user2679290 | CC BY-SA 4.0 |
[Edit removed during grace period]; deleted 6 characters in body; added 1 character in body
|
Mar 24, 2020 at 22:52 | history | edited | user6976 | CC BY-SA 4.0 |
replace trianry by ternary
|
Mar 24, 2020 at 22:42 | comment | added | user6976 | $x,y$ are by definition $m$-tuples of words. So "concatenation" does not make sense. | |
Mar 24, 2020 at 20:55 | comment | added | Shahrooz | Does $xy$ means the concatenation of $x$ and $y$? Please give an example for such codes and the function $f$ | |
Mar 24, 2020 at 20:34 | history | edited | user2679290 | CC BY-SA 4.0 |
added 24 characters in body
|
Mar 24, 2020 at 20:29 | comment | added | user2679290 | I improved this, but let me know what is unclear, if it is still unclear. | |
Mar 24, 2020 at 20:28 | history | edited | user2679290 | CC BY-SA 4.0 |
added 113 characters in body
|
Mar 24, 2020 at 20:05 | history | edited | YCor | CC BY-SA 4.0 |
fixed title
|
Mar 24, 2020 at 19:55 | review | Close votes | |||
Apr 7, 2020 at 19:46 | |||||
Mar 24, 2020 at 19:50 | comment | added | Shahrooz | Your question is not clear. Please give more details if you want appropriate answers. | |
Mar 24, 2020 at 19:29 | history | asked | user2679290 | CC BY-SA 4.0 |