Manual Text Compression Algorithm (done by hand)
$begingroup$
Last year (I'm in 10th grade), during most unit/chapter tests, we were allowed to bring notes. We could prepare a 3 x 5 in. (7.62 x 12.7 cm) index card at home, and cram it with as many notes as possible; this index card could then be used on the test.
One of my classmates had the idea of writing in red, then over that in blue, and using anaglyph red-cyan 3D glasses (she distributed one to everyone), so we could fit twice as much information on one index card.
Since then, I've been wondering about taking that to the next level: (de)compressing text manually.
What I am looking for is an efficient text compression algorithm where at least the decompression process can be done by hand (the compression process can be done electronically).
The desirable process is this:
- Compress notes with a computer at home the day before the test
- Write compressed text on an index card
- Take the index card to the test
- Use the first 2-5 (maximum 10) minutes of the test to use the back page (which is usually at least half blank) to manually decompress the data
- The decompressed, readable notes are on the back page of the test, ready to be used during the test whenever necessary.
compression
asked Oct 9 '18 at 15:25
CerebralDatabankCerebralDatabank
63
$endgroup$
add a comment |
$begingroup$
Last year (I'm in 10th grade), during most unit/chapter tests, we were allowed to bring notes. We could prepare a 3 x 5 in. (7.62 x 12.7 cm) index card at home, and cram it with as many notes as possible; this index card could then be used on the test.
One of my classmates had the idea of writing in red, then over that in blue, and using anaglyph red-cyan 3D glasses (she distributed one to everyone), so we could fit twice as much information on one index card.
Since then, I've been wondering about taking that to the next level: (de)compressing text manually.
What I am looking for is an efficient text compression algorithm where at least the decompression process can be done by hand (the compression process can be done electronically).
The desirable process is this:
- Compress notes with a computer at home the day before the test
- Write compressed text on an index card
- Take the index card to the test
- Use the first 2-5 (maximum 10) minutes of the test to use the back page (which is usually at least half blank) to manually decompress the data
- The decompressed, readable notes are on the back page of the test, ready to be used during the test whenever necessary.
compression
asked Oct 9 '18 at 15:25
CerebralDatabankCerebralDatabank
63
$endgroup$
1
$begingroup$
This will depend heavily on the subject of the test. If the test is about "moral advice to children" a lot of compression is possible; if the test is about "trigonometric formulas" every typographical token counts.
$endgroup$
– Christian Blatter
Oct 9 '18 at 15:33
1
$begingroup$
Instead of reinventing the wheel, learn speedwriting instead.
$endgroup$
– achille hui
Oct 9 '18 at 15:35
$begingroup$
Note that you'll also need to memorize the decompression algorithm. If you have a very long algorithm, the space needed on the notecard is small, but then you have to remember a lot. Depending on the subject I think the suggestion to use shorthand is a good one. Otherwise mnemonics and other methods of remembering things might be useful
$endgroup$
– tch
Dec 25 '18 at 20:27
add a comment |
$begingroup$
Last year (I'm in 10th grade), during most unit/chapter tests, we were allowed to bring notes. We could prepare a 3 x 5 in. (7.62 x 12.7 cm) index card at home, and cram it with as many notes as possible; this index card could then be used on the test.
One of my classmates had the idea of writing in red, then over that in blue, and using anaglyph red-cyan 3D glasses (she distributed one to everyone), so we could fit twice as much information on one index card.
Since then, I've been wondering about taking that to the next level: (de)compressing text manually.
What I am looking for is an efficient text compression algorithm where at least the decompression process can be done by hand (the compression process can be done electronically).
The desirable process is this:
- Compress notes with a computer at home the day before the test
- Write compressed text on an index card
- Take the index card to the test
- Use the first 2-5 (maximum 10) minutes of the test to use the back page (which is usually at least half blank) to manually decompress the data
- The decompressed, readable notes are on the back page of the test, ready to be used during the test whenever necessary.
compression
asked Oct 9 '18 at 15:25
CerebralDatabankCerebralDatabank
63
$endgroup$
Last year (I'm in 10th grade), during most unit/chapter tests, we were allowed to bring notes. We could prepare a 3 x 5 in. (7.62 x 12.7 cm) index card at home, and cram it with as many notes as possible; this index card could then be used on the test.
One of my classmates had the idea of writing in red, then over that in blue, and using anaglyph red-cyan 3D glasses (she distributed one to everyone), so we could fit twice as much information on one index card.
Since then, I've been wondering about taking that to the next level: (de)compressing text manually.
What I am looking for is an efficient text compression algorithm where at least the decompression process can be done by hand (the compression process can be done electronically).
The desirable process is this:
- Compress notes with a computer at home the day before the test
- Write compressed text on an index card
- Take the index card to the test
- Use the first 2-5 (maximum 10) minutes of the test to use the back page (which is usually at least half blank) to manually decompress the data
- The decompressed, readable notes are on the back page of the test, ready to be used during the test whenever necessary.
compression
compression
asked Oct 9 '18 at 15:25
CerebralDatabankCerebralDatabank
63
asked Oct 9 '18 at 15:25
CerebralDatabankCerebralDatabank
63
asked Oct 9 '18 at 15:25
CerebralDatabankCerebralDatabank
63
asked Oct 9 '18 at 15:25
CerebralDatabankCerebralDatabank
63
asked Oct 9 '18 at 15:25
CerebralDatabankCerebralDatabank
63
63
1
$begingroup$
This will depend heavily on the subject of the test. If the test is about "moral advice to children" a lot of compression is possible; if the test is about "trigonometric formulas" every typographical token counts.
$endgroup$
– Christian Blatter
Oct 9 '18 at 15:33
1
$begingroup$
Instead of reinventing the wheel, learn speedwriting instead.
$endgroup$
– achille hui
Oct 9 '18 at 15:35
$begingroup$
Note that you'll also need to memorize the decompression algorithm. If you have a very long algorithm, the space needed on the notecard is small, but then you have to remember a lot. Depending on the subject I think the suggestion to use shorthand is a good one. Otherwise mnemonics and other methods of remembering things might be useful
$endgroup$
– tch
Dec 25 '18 at 20:27
add a comment |
1
$begingroup$
This will depend heavily on the subject of the test. If the test is about "moral advice to children" a lot of compression is possible; if the test is about "trigonometric formulas" every typographical token counts.
$endgroup$
– Christian Blatter
Oct 9 '18 at 15:33
1
$begingroup$
Instead of reinventing the wheel, learn speedwriting instead.
$endgroup$
– achille hui
Oct 9 '18 at 15:35
$begingroup$
Note that you'll also need to memorize the decompression algorithm. If you have a very long algorithm, the space needed on the notecard is small, but then you have to remember a lot. Depending on the subject I think the suggestion to use shorthand is a good one. Otherwise mnemonics and other methods of remembering things might be useful
$endgroup$
– tch
Dec 25 '18 at 20:27
1
1
$begingroup$
This will depend heavily on the subject of the test. If the test is about "moral advice to children" a lot of compression is possible; if the test is about "trigonometric formulas" every typographical token counts.
$endgroup$
– Christian Blatter
Oct 9 '18 at 15:33
$begingroup$
This will depend heavily on the subject of the test. If the test is about "moral advice to children" a lot of compression is possible; if the test is about "trigonometric formulas" every typographical token counts.
$endgroup$
– Christian Blatter
Oct 9 '18 at 15:33
1
1
$begingroup$
Instead of reinventing the wheel, learn speedwriting instead.
$endgroup$
– achille hui
Oct 9 '18 at 15:35
$begingroup$
Instead of reinventing the wheel, learn speedwriting instead.
$endgroup$
– achille hui
Oct 9 '18 at 15:35
$begingroup$
Note that you'll also need to memorize the decompression algorithm. If you have a very long algorithm, the space needed on the notecard is small, but then you have to remember a lot. Depending on the subject I think the suggestion to use shorthand is a good one. Otherwise mnemonics and other methods of remembering things might be useful
$endgroup$
– tch
Dec 25 '18 at 20:27
$begingroup$
Note that you'll also need to memorize the decompression algorithm. If you have a very long algorithm, the space needed on the notecard is small, but then you have to remember a lot. Depending on the subject I think the suggestion to use shorthand is a good one. Otherwise mnemonics and other methods of remembering things might be useful
$endgroup$
– tch
Dec 25 '18 at 20:27
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
As suggested by Achille Hui:
Instead of reinventing the wheel, learn speedwriting instead.
Speedwriting
answered Dec 25 '18 at 20:04
CerebralDatabankCerebralDatabank
63
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2948667%2fmanual-text-compression-algorithm-done-by-hand%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
As suggested by Achille Hui:
Instead of reinventing the wheel, learn speedwriting instead.
Speedwriting
answered Dec 25 '18 at 20:04
CerebralDatabankCerebralDatabank
63
$endgroup$
add a comment |
$begingroup$
As suggested by Achille Hui:
Instead of reinventing the wheel, learn speedwriting instead.
Speedwriting
answered Dec 25 '18 at 20:04
CerebralDatabankCerebralDatabank
63
$endgroup$
add a comment |
$begingroup$
As suggested by Achille Hui:
Instead of reinventing the wheel, learn speedwriting instead.
Speedwriting
answered Dec 25 '18 at 20:04
CerebralDatabankCerebralDatabank
63
$endgroup$
As suggested by Achille Hui:
Instead of reinventing the wheel, learn speedwriting instead.
Speedwriting
answered Dec 25 '18 at 20:04
CerebralDatabankCerebralDatabank
63
answered Dec 25 '18 at 20:04
CerebralDatabankCerebralDatabank
63
answered Dec 25 '18 at 20:04
CerebralDatabankCerebralDatabank
63
answered Dec 25 '18 at 20:04
CerebralDatabankCerebralDatabank
63
63
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2948667%2fmanual-text-compression-algorithm-done-by-hand%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
This will depend heavily on the subject of the test. If the test is about "moral advice to children" a lot of compression is possible; if the test is about "trigonometric formulas" every typographical token counts.
$endgroup$
– Christian Blatter
Oct 9 '18 at 15:33
1
$begingroup$
Instead of reinventing the wheel, learn speedwriting instead.
$endgroup$
– achille hui
Oct 9 '18 at 15:35
$begingroup$
Note that you'll also need to memorize the decompression algorithm. If you have a very long algorithm, the space needed on the notecard is small, but then you have to remember a lot. Depending on the subject I think the suggestion to use shorthand is a good one. Otherwise mnemonics and other methods of remembering things might be useful
$endgroup$
– tch
Dec 25 '18 at 20:27