Timeline for Adjacency matrices of graphs as parity check matrices of error correcting codes
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 27, 2012 at 13:52 | comment | added | Alexander Chervov | @Chris Thank You, I corrected ! Shame on me I am always mixing these matrices. Fields medalist G. Margulis constructed some "good" LDPC codes by Cayley graphs (???) of some groups GL(F,p) - as I heard but not really understand. There are lots of papers about "expanders" graphs which is probably related to this question... I just start learning these things so, may be question is not really good... | |
| Feb 27, 2012 at 13:45 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
edited body; edited title
|
| Feb 27, 2012 at 13:35 | comment | added | Chris Godsil | What you have called the incidence matrix is actually the adjacency matrix (as will be clear if you read the article you've linked to). Your approach translates all coding theory questions into graph theory questions. It seems unlikely that much will be gained by the translation. Of course there are many papers studying the case when $A$ is sparse (LDPC codes). | |
| Feb 27, 2012 at 12:55 | history | edited | Alexander Chervov | CC BY-SA 3.0 |
edited title
|
| Feb 27, 2012 at 12:37 | history | asked | Alexander Chervov | CC BY-SA 3.0 |