Pad encoding and decoding

Patent metadata

Field	Value
Publication number	US-9350382-B1
Application number	US-201514947068-A
Country	US
Kind code	B1
Filing date	Nov 20, 2015
Priority date	Dec 19, 2014
Publication date	May 24, 2016
Grant date	May 24, 2016

Abstract

A system, method and computer program product for encoding an input string of binary characters representing alphanumeric characters. A system includes: a register for storing a two dimensional cellular shape definition including a starting empty cell; a character writing engine for writing a binary character to an empty cell with a predefined initial position; a next cell determination engine for determining a next empty cell by methodically traversing neighboring cells in the two dimensional shape until an empty cell is located; a loop facilitator for looping back to the character writing engine and the next cell determining engine until there are no more data characters or a next empty cell is not determined; and a serialization engine for methodically serializing the two dimensional cells into a one dimensional binary string of characters representing an encoded string of alphanumeric characters.

First claim

The invention claimed is:

1. A system for encoding an input string of binary characters representing alphanumeric characters, comprising:
a register for storing a two dimensional cellular shape definition including a starting empty cell;
a character writing engine for writing a binary character to an empty cell beginning with the starting empty cell;
a next cell determination engine for determining a next empty cell by methodically traversing neighboring cells in the two dimensional shape until an empty cell is located;
a loop facilitator for looping back to the character writing engine and the next cell determining engine until there are no more data characters or a next empty cell is not determined; and
a serialization engine for methodically serializing the two dimensional cells into a one dimensional binary string of characters representing an encoded string of alphanumeric characters.

2. A system according to claim 1 , wherein methodically traversing comprises moving from the current cell in a current direction to a new cell and wherein the new cell is the next cell if the new cell is an empty cell otherwise traversing again until an empty cell is located.

3. A system according to claim 1 , further comprising changing a direction of traversing to locate an empty cell.

4. A system according to claim 1 , further comprising traversing to adjacent cells to locate a next cell but if no neighboring cells are empty then traversing to a non-neighboring cell to locate an empty cell.

5. A system according to claim 1 , further comprising changing a current direction of traversing if a particular binary character has been written.

6. A system according to claim 1 , further comprising using a different direction if traversing in a current direction would cross the boundary of the two dimensional shape.

7. A system according to claim 6 , wherein the current direction changes to an opposite direction if the current direction would hit the edge of the two dimensional shape.

8. A system for decoding an input string of binary characters representing an encoded string of alphanumeric characters, comprising:
a register for storing a two dimensional shape definition of regular cells including a starting current cell;
a serialization de-serialization engine for populating the cells with the binary characters using a defined transform so that each populated cell is full;
a character reading and writing for reading a binary character from the current cell; writing it to an output string, and setting the current cell to empty;
a next cell determination engine for determining a next full cell by methodically traversing from the current cell to adjacent cells in the two dimensional shape until a full cell is located;
a loop facilitator for looping back to the reading next character step and the determining next cell step until there are no more data characters or a next full cell is not determined; and whereby the output string is a dimensional binary string of characters representing an encoded string of alphanumeric characters.

9. A method of encoding an input string of binary characters representing alphanumeric characters, comprising:
defining a two dimensional shape of regular cells including a starting empty cell;
writing a binary character to an empty cell beginning with a starting empty cell;
determining a next empty cell by methodically neighboring cells in the two dimensional shape until an empty cell is located;
looping back to the writing next character step and the determining next cell step until there are no more data characters or a next empty cell is not determined; and
methodically serializing the two dimensional cells into a one dimensional binary string of characters representing an encoded string of alphanumeric characters.

10. A method according to claim 9 , wherein methodically traversing comprises moving from the current cell in a current direction to a new cell and wherein the new cell is the next cell if the new cell is an empty cell otherwise traversing again until an empty cell is located.

11. A method according to claim 9 , further comprising changing a direction of traversing to locate an empty cell.

12. A method according to claim 9 , further comprising traversing to adjacent cells to locate a next cell but if no neighboring cells are empty then traversing to a non-neighboring cell to locate an empty cell.

13. A method according to claim 9 , further comprising changing a current direction if a particular binary character has been written.

14. A method according to claim 9 , further comprising using a different direction if traversing in a current direction would cross the boundary of the two dimensional shape.

15. A method according to claim 14 , wherein the current direction changes to an opposite direction if the current direction would hit the edge of the two dimensional shape.

16. A method according to claim 9 , wherein the two dimensional shape is a rectangle having width and height or a honeycomb matrix of six sided cells.

17. A method according to claim 9 , wherein the cells have an initial filled in pattern.

18. A method of decoding an input string of binary characters representing an encoded string of alphanumeric characters comprising:
defining a two dimensional shape of regular cells including a starting current cell;
populating the cells with the binary characters using a defined transform so that each populated cell is full;
reading a binary character from the current cell; writing it to an output string, and setting the current cell to empty;
determining a next full cell by methodically traversing from the current cell to adjacent cells in the two dimensional shape until a full cell is located;
looping back to the reading next character step and the determining next cell step until there are no more data characters or a next full cell is not determined; and
methodically serializing the two dimensional cells into a one dimensional binary string of characters representing an encoded string of alphanumeric characters.

19. A computer program stored on a computer readable medium and loadable into the internal memory of a digital computer, comprising software code portions, when said program is run on a computer, for performing the method of claim 9 .

20. A computer program stored on a computer readable medium and loadable into the internal memory of a digital computer, comprising software code portions, when said program is run on a computer, for performing the method of claim 18 .

Assignees

• IBM

Inventors

• Bauchot Frederic J
• Legroux Marc Joel Herve

Classifications

• H03M7/6047

  Power optimization with respect to the encoder, decoder, storage or transmission · CPC title

• H03M7/00

  Conversion of a code where information is represented by a given sequence or number of digits to a code where the same {, similar or subset of} information is represented by a different sequence or number of digits · CPC title

• H04L9/30

  Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy · CPC title

• H04L9/16

  the keys or algorithms being changed during operation · CPC title

• H03M7/3084 Primary

  using adaptive string matching, e.g. the Lempel-Ziv method · CPC title