1. A compound represented by Structural Formula I:
wherein:
R and R\u2032 are independently H or optionally substituted alkyl and at least one of R and R\u2032 is H;
Z is \u2014C(O)NRc\u2014, \u2014NRcC(O)\u2014, \u2014NRc\u2014, \u2014CRc\u2550N\u2014, \u2014C(O)\u2014, \u2014C(O)O\u2014, \u2014OC(O)\u2014, \u2014O\u2014, \u2014S\u2014, \u2014C(O)OC(O)\u2014 or a bond;
Rc is independently H or optionally substituted alkyl;
Ra, for each occurrence, is independently an optionally substituted alkyl, optionally substituted aryl, optionally substituted alkoxycarbonyl, optionally substituted ester, \u2014OH, \u2014NH2, \u2014SH;
Rb, for each occurrence, is independently H or optionally substituted alkyl;
s, for each occurrence, is independently integers from 0 to 4; and
m and n, for each occurrence, are independently integers from 0 to 6.
2. The compound of claim 1, wherein:
Z is \u2014C(O)O\u2014, \u2014OC(O)\u2014, \u2014C(O)NH\u2014, \u2014NHC(O)\u2014, \u2014NH\u2014, \u2014O\u2014 or \u2014C(O)\u2014;
Rb is H;
Ra, for each occurrence is independently an optionally substituted alkyl or optionally substituted alkoxycarbonyl;
n and m, for each occurrence, are independently integers from 0 to 2; and
s, for each occurrence, is independently an integer from 0 to 2.
3. The compound of claim 2, wherein:
Z is \u2014C(O)NH\u2014 or \u2014NHC(O)\u2014;
Ra, for each occurrence is independently an alkyl or an alkoxycarbonyl;
and s is 2.
4. The compound of claim 3, wherein each Ra is independently an alkyl group.
5. The compound of claim 1, wherein the compound is represented by Structural Formula II:
wherein:
R and R\u2032 are independently H or optionally substituted alkyl and at least one of R and R\u2032 is H;
Ra, for each occurrence, is independently an optionally substituted alkyl, optionally substituted aryl, optionally substituted alkoxycarbonyl, optionally substituted ester, \u2014OH, \u2014NH2, or \u2014SH;
Rb, for each occurrence, is independently H or optionally substituted alkyl.
s, for each occurrence, is independently an integer from 0 to 4; and
m, for each occurrence, is independently an integer from 0 to 6.
6. The compound of claim 5, wherein:
Ra, for each occurrence, is independently an optionally substituted alkyl;
Rb is H;
s, for each occurrence, is independently an integer from 0 to 2; and
m, for each occurrence, is independently an integer from 0 to 2.
7. The compound of claim 6, wherein Ra is independently an alkyl and s is 2.
8. The compound of claim 1, wherein the compound is represented by Structural Formula III:
wherein:
R and R\u2032 are independently H or optionally substituted alkyl and at least one of R and R\u2032 is H.
9. The compound of claim 8, wherein R and R\u2032 are H.
10. The compound of claim 8, wherein R is H and R\u2032 is an alkyl.
11. The compound of claim 10, wherein R\u2032 is a C1-C15 alkyl.
12. The compound of claim 11, wherein R\u2032 is a C10 alkyl.
13. The compound of claim 12, wherein R\u2032\u2550\u2014(CH2)9CH3.
14. A method of inhibiting oxidation in an oxidizable material comprising combining the oxidizable material with a compound represented by Structural Formula I
wherein:
R and R\u2032 are independently H or optionally substituted alkyl and at least one of R and R\u2032 is H;
Z is \u2014C(O)NRc\u2014, \u2014NRcC(O)\u2014, \u2014NRc\u2014, \u2014CRc\u2550N\u2014, \u2014C(O)\u2014, \u2014C(O)O\u2014, \u2014OC(O)\u2014, \u2014O\u2014, \u2014S\u2014, \u2014C(O)OC(O)\u2014 or a bond;
Rc is independently H or optionally substituted alkyl;
Ra, for each occurrence, is independently an optionally substituted alkyl, optionally substituted aryl, optionally substituted alkoxycarbonyl, optionally substituted ester, \u2014OH, \u2014NH2, \u2014SH;
Rb, for each occurrence, is independently H or optionally substituted alkyl;
s, for each occurrence, is independently an integer from 0 to 4; and
m and n, for each occurrence, are independently integers from 0 to 6.
15. The method of claim 14, wherein
Z is \u2014C(O)O\u2014, \u2014OC(O)\u2014, \u2014C(O)NH\u2014, \u2014NHC(O)\u2014, \u2014NH\u2014, \u2014O\u2014 or \u2014C(O)\u2014;
Rb is H;
Ra, for each occurrence is independently an optionally substituted alkyl or optionally substituted alkoxycarbonyl;
n and m, for each occurrence, are independently integers from 0 to 2; and
s, for each occurrence, is independently an integer from 0 to 2.
16. The method of claim 15, wherein:
Z is \u2014C(O)NH\u2014 or \u2014NHC(O)\u2014;
Ra, for each occurrence is independently an alkyl or an alkoxycarbonyl;
and s is 2.
17. The method of claim 16, wherein each Ra is independently an alkyl group.
18. The method of claim 14, wherein the compound is represented by Structural Formula II:
wherein:
R and R\u2032 are independently H or optionally substituted alkyl and at least one of R and R\u2032 is H;
Ra, for each occurrence, is independently an optionally substituted alkyl, optionally substituted aryl, optionally substituted alkoxycarbonyl, optionally substituted ester, \u2014OH, \u2014NH2, or \u2014SH;
Rb, for each occurrence, is independently H or optionally substituted alkyl.
s, for each occurrence, is independently an integer from 0 to 4; and
m, for each occurrence, is independently an integer from 0 to 6.
19. The method of claim 18, wherein:
Ra, for each occurrence, is independently an optionally substituted alkyl;
Rb is H;
s, for each occurrence, is independently an integer from 0 to 2; and
m, for each occurrence, is independently an integer from 0 to 2.
20. The method of claim 19, wherein Ra is independently an alkyl and s is 2.
21. The method of claim 14, wherein the compound is represented by Structural Formula III:
wherein:
R and R\u2032 are independently H or optionally substituted alkyl and at least one of R and R\u2032 is H.
22. The method of claim 21, wherein R and R\u2032 are H.
23. The method of claim 21, wherein R is H and R\u2032 is an alkyl.
24. The method of claim 23, wherein R\u2032 is a C1-C15 alkyl.
25. The method of claim 24, wherein R\u2032 is a C10 alkyl.
26. The method of claim 25, wherein R\u2032\u2550\u2014(CH2)9CH3.
27. The method of claim 14, wherein the oxidizable material is an organic polymer or plastic.
28. The method of claim 14, wherein the oxidizable material is an elastomer.
29. The method of claim 14, wherein the oxidizable material is a lubricant.
30. The method of claim 14, wherein the oxidizable material is a petroleum based product.
31. The method of claim 14, wherein the oxidizable material is an edible oil or cooking oil.
32. The method of claim 14, wherein the oxidizable material is a cosmetic.
33. The method of claim 14, wherein the oxidizable material is a processed food product.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for transmitting and receiving a packet of information, comprising:
generating a table having a plurality of associated operation codes, scrambler syndrome values, scrambled values, and encoded code words, wherein the plurality of encoded code words have been selected based upon predetermined criteria and each code word has a maximum hamming distance between all other encoded code words;
resetting a scrambler generator using a scrambler seed value at the beginning of transmission;
scrambling a plurality of data value by XORing the plurality of data values with a value from the scrambler syndrome generator to form a plurality of scrambled values;
encoding the plurality of scrambled values to a plurality of encoded scrambled values having a greater number of bits;
transmitting an encoded code word representing an operation code to a receiving device; decoding and descrambling the encoded code word to create a code word;
comparing the code word against the table having the plurality of associated operation codes, scrambler syndrome values, scrambled values, and encoded code words by the receiving device; and
acting upon the received opcode immediately after decoding to properly process the rest of the incoming data.
2. The method recited in claim 1, wherein the predetermined selection criteria is that each encoded code word will have any equal number of ones and zeros.
3. The method recited in claim 2, wherein the minimum hamming distance between the encoded code words prevents each of the encoded code words from having fewer than a predetermined number of bits different from any other encoded code word.
4. The method recited in claim 3, wherein the accepting of the data when a match is found in the table containing all the encoded code word, further comprises:
receiving a character by the receiving device;
decoding the received character to reduce the number of bits contained in the receive character;
de-scrambling the character by XORing the character with the value received from the scrambler generator;
determining if a first character received is a valid opcode by comparing the first to a table containing opcodes;
transmitting a retransmission when the first character is not a valid opcode and
repeating receiving a character by the receiving device, decoding the received character to reduce the number of bits contained in the receive character, de scrambling the character by XORing the character with the value received from the scrambler generator until no further characters are received when the first character is a valid opcode.
5. The method recited in claim 4, wherein the predetermined selection criteria is that each encoded code word will have any equal number of ones and zeros.
6. The method recited in claim 5, wherein the hamming distance between the plurality of encoded code words prevents any two encoded code words of the plurality of encoded code words having fewer then a predetermined number of bits different.
7. The method recited in claim 6, wherein the minimum hamming distance is four bits.
8. A computer program embodied on a computer readable medium and executable by a computer, comprising:
generating a table having a plurality of associated operation codes, scrambler syndrome values, scrambled values, and encoded code words, wherein the plurality of encoded code words have been selected based upon predetermined criteria and each code word has a minimum hamming distance between all other encoded code words;
resetting a scrambler generator using a seed value;
scrambling a plurality of data values by XORing the plurality of data values with the plurality of data values generated by the scrambler generator to form a plurality of scrambled values;
converting the plurality of scrambled values to a plurality of encoded scrambled values having a greater number of bits;
transmitting an encoded code word representing an operation code to a receiving device;
decoding and descrambling the encoded code word to create a code word;
comparing the code word against the table having the plurality of associated operation codes, scrambler syndrome values, scrambled values, and encoded code words by the receiving device; and
requesting a retransmission of data when a match cannot be found in the table for the encoded code words.
9. The computer program recited in claim 8, wherein the predetermined selection criteria is that each encoded code word will have any equal number of ones and zeros.
10. The computer program recited in claim 9, wherein the minimum hamming distance between the encoded code words prevents each of the encoded code words from having fewer than a predetermined number of bits different from any other encoded code words.
11. The computer program recited in claim 10, wherein the accepting of the data when a match is found in the table containing all the encoded code word, further comprises:
receiving a character by the receiving device;
decoding the received character to reduce the number of bits contained in the receive character;
de scrambling the character by XORing the character with the value received from the scrambler generator;
determining if a first character received is a valid opcode by comparing the first to a table containing opcodes;
transmitting a retransmission request when the first character is not a valid opcode and
repeating receiving a character by the receiving device, decoding the received character to reduce the number of bits contained in the receive character, de-scrambling the character by XORing the character with the value received from the scrambler generator until no further characters are received when the first character is a valid opcode.
12. The computer program recited in claim 11, wherein the predetermined selection criteria is that each encoded code word will have any equal number of ones and zeros.
13. The computer program recited in claim 12, wherein the hamming distance between the plurality of encoded code words from having fewer than a predetermined number of bits different.
14. The computer program recited in claim 13, wherein the minimum hamming distance is four bits.
15. A device for transmitting and receiving a packet of information, comprising:
a transmission unit, comprising:
a scrambler generator reset to a seed value upon the first byte of data transmitted;
an XOR unit connected to the scrambler generator to XOR data received along with the seed value generated by the scrambler unit; and
a 8b10b encoder connected to the XOR unit to convert the data from an eight bit format;
a reception unit, comprising:
a scrambler generator which is reset when the data received;
a 10b8b decoder to convert the data from a 10 bits format to an 8 bit format;
an XOR unit connected to the 10b8b decoder to exclusive or the data received with a value from the scrambler generator to create an opcode; and
an opcode verification unit to check the validity of the opcode.
16. The device recited in claim 15, wherein the first byte of data is an operation code of a plurality of operation codes which are encoded to have equal number of bits set to zero and one and to have a maximum hamming distance between the plurality of operation codes, wherein the minimum hamming distance is no two operation codes have fewer than four bits different.