Method and/or system for transmitting and/or receiving data

• US 9,077,515 B2
• Filed: 01/07/2014
• Issued: 07/07/2015
• Est. Priority Date: 11/30/2004
• Status: Expired due to Fees

• Current Assignee: Lower48 IP, LLC (Lower48 Analytics, Inc.)
• Original Assignee: Robert T. Jenkins, Virginia T. Jenkins
• Inventors: Letourneau, Jack J.
• Primary Examiner(s): LU, KUEN S
• Application Number:
  US14/149,749
• Publication Number:
  US 20140362961A1
• Time in Patent Office: 546 Days
• Field of Search: 707/797, 375/359
• US Class Current: 1/1
• CPC Class Codes: G06F 16/235 Update request formulation
• CPC Class Codes: H04L 1/0041 Arrangements at the transmitter end
• CPC Class Codes: H04L 7/04 Speed or phase control by synchronisation signals H04L7/0075 takes precedence
• CPC Class Codes: H04L 7/041 using special codes as synchronising signal
• CPC Class Codes: H04M 2201/22 Synchronisation circuits
• CPC Class Codes: H04N 19/68 involving the insertion of resynchronisation markers into the bitstream
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

Embodiments of a method and/or system of transmitting and/or receiving data is disclosed.

Claims

1. A method comprising:

executing instructions on one or more processors, said executing comprising;

communicating via a communications channel a sequence of binary values in the form of digital electronic signals;

said sequence representing a sequence of finite labeled trees in the form of digital electronic signals;

wherein said sequence of binary values includes padding values between two or more representations of a finite tree in said sequence;

the padding values comprising control signal information or content signal information;

and said control signal information comprising at least one of the following;

error correction coding information;

encryption control information;

authentication control information;

watermarking control information;

or multiplexing control information and/or said content signal information comprising at least one of the following;

VoIP encoding signal information;

video signal information;

audio signal information;

picture signal information;

or information about the content of said sequence.

2. The method of claim 1, wherein the finite trees comprise signal information in the form of natural numerals.

3. The method of claim 2, wherein said natural numerals are obtained from the binary sequence as follows:

[0]→

empty sequence

[1]( )

[2x]→

( )[x]

[Q(x)]→

([x])

[x*y]→

[x][y];

wherein x, y comprise natural numerals, [x] comprises a binary sequence, and [x][y] comprises a concatenation of binary sequences.

4. The method of claim 1, wherein said sequence is synchronized through a count accumulation.

5. The method of claim 1, wherein said padding values are distinguished in said sequence through a count accumulation.

6. The method of claim 1, wherein said finite labeled trees are distinguished in said sequence by a count accumulation.

7. An article comprising:

a storage device having stored thereon instructions executable by one or more processors to result in performance of a method as follows;

communicating a sequence of binary values in the form of digital electronic signals;

said sequence representing a sequence of finite labeled trees in the form of digital electronic signals;

wherein said sequence of binary values includes padding values between two or more representations of a finite tree in said sequence;

the padding values comprising control signal information or content signal information;

and said control signal information comprising at least one of the following;

error correction coding information;

encryption control information;

authentication control information;

watermarking control information;

or multiplexing control information and/or said content signal information comprising at least one of the following;

VoIP encoding signal information;

video signal information;

audio signal information;

picture signal information;

or information about the content of said sequence.

8. The article of claim 7, wherein the instructions, when executed, further result in the finite trees comprising signal information in the form of natural numerals.

9. The article of claim 8, wherein the instructions, when executed, further result in said natural numerals being obtained from the binary sequence as follows:

[0]→

empty sequence

[1]→

( )

[2x]→

( )[x]

[Q(x)]→

([x])

[x*y]→

[x][y];

wherein x, y comprise natural numerals, [x] comprises a binary sequence, and [x][y] comprises a concatenation of binary sequences.

10. The article of claim 7, wherein the instructions, when executed, further result in said sequence being synchronized through a count accumulation.

11. The article of claim 7, wherein the instructions, when executed, further result in said padding values being distinguished in said sequence through a count accumulation.

12. The article of claim 7, wherein the instructions, when executed, further result in finite trees being distinguished in said sequence by a count accumulation.

13. An apparatus comprising:

a computing platform comprising a computing device;

said computing platform including said computing device to communicate a sequence of binary values in the form of digital electronic signals;

said sequence to represent a sequence of finite labeled trees in the form of digital electronic signals;

said sequence to include padding values between two or more representations of a finite tree in said sequence;

said padding values to comprise control signal information or content signal information;

said control signal information to comprise at least one of the following;

error correction coding information;

encryption control information;

authentication control information;

watermarking control information;

or multiplexing control information and/or said content signal information to comprise at least one of the following;

VoIP encoding signal information;

video signal information;

audio signal information;

picture signal information;

or information about the content of said sequence.

14. The apparatus of claim 13, wherein said computing platform is to communicate a sequence of binary values in which the finite trees comprise signal information in the form of natural numerals.

15. The apparatus of claim 14, wherein said computing platform is to communicate a sequence of binary values in which said natural numerals are to be obtained from the binary sequence as follows:

[0]→

empty sequence

[1]→

( )

[2x]→

( )[x]

[Q(x)]→

([x])

[x*y]→

[x][y];

wherein x, y to comprise natural numerals, [x] to comprise a binary sequence, and [x][y] to comprise a concatenation of binary sequences.

16. The apparatus of claim 13, wherein said computing platform is to communicate a sequence of binary values in which said sequence is to be synchronized through a count accumulation.

17. The apparatus of claim 13, wherein said computing platform is to communicate a sequence of binary values in which said padding values are to be distinguished in said sequence through a count accumulation.

18. The apparatus of claim 13, wherein said computing platform is to communicate a sequence of binary values in which finite trees are to be distinguished in said sequence by a count accumulation.

19. An apparatus comprising:

a computing platform comprising a computing device;

said computing platform including said computing device comprising means for communicating a sequence of binary values in the form of digital electronic signals;

said sequence to represent a sequence of finite labeled trees in the form of digital electronic signals;

said sequence to include padding values between two or more representations of a finite tree in said sequence;

said padding values to comprise control signal information or content signal information;

said control signal information to comprise at least one of the following;

error correction coding information;

encryption control information;

authentication control information;

watermarking control information;

or multiplexing control information and/or said content signal information to comprise at least one of the following;

VoIP encoding signal information;

video signal information;

audio signal information;

picture signal information;

or information about the content of said sequence.

20. The apparatus of claim 19, wherein said means for communicating comprising means for communicating a sequence of binary values in which the finite trees comprise signal information capable of being put in the form of natural numerals.

21. The apparatus of claim 20, wherein said means for communicating comprises means for communicating a sequence of binary values in which said natural numerals are to be obtained from the binary sequence.

22. The apparatus of claim 19, wherein said means for communicating comprises means for communicating a sequence of binary values in which said sequence is to be synchronized through a count accumulation.

23. The apparatus of claim 19, wherein said means for communicating comprises means for communicating a sequence of binary values in which said padding values are to be distinguished in said sequence through a count accumulation.

24. The apparatus of claim 19, wherein said means for communicating comprises means for communicating a sequence of binary values in which finite trees are to be distinguished in said sequence by a count accumulation.