aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMattias Andrée <maandree@member.fsf.org>2015-12-21 06:31:48 +0100
committerMattias Andrée <maandree@member.fsf.org>2015-12-21 06:31:48 +0100
commitabc332a5a6888d3700e54d7047f4c9e3e89027e6 (patch)
treee40ff0bb628e41584ad07b56ea2af268622d99d6
parentm (diff)
downloadfodtmf-abc332a5a6888d3700e54d7047f4c9e3e89027e6.tar.gz
fodtmf-abc332a5a6888d3700e54d7047f4c9e3e89027e6.tar.bz2
fodtmf-abc332a5a6888d3700e54d7047f4c9e3e89027e6.tar.xz
future directions
Signed-off-by: Mattias Andrée <maandree@member.fsf.org>
Diffstat (limited to '')
-rw-r--r--README7
1 files changed, 7 insertions, 0 deletions
diff --git a/README b/README
index 3b8e3b9..ba82364 100644
--- a/README
+++ b/README
@@ -110,6 +110,13 @@ NOTES
But note well, which compresion algorithm is most
efficient depends on the file.
+FUTURE DIRECTIONS
+ afodtmf (Advanced File over DTMF) will be written. It
+ will make the computers communicate with each other
+ bidirectionally (limited to one-to-one communication)
+ to repair errors that could not be correct using
+ the error-correcting code.
+
RATIONALE
I really don't know precisely why. But it sounded fun.