1. A modulation apparatus for converting data with a basic data length of m bits into variable length code (d k; m, n; r) with a basic code length of n bits where d is a minimum run and k is a run length limit, said modulation apparatus characterized by having conversion means for converting input data into code in accordance with a conversion table wherein said conversion table enforces a conversion rule, according to which the remainder of division of a \u20181\u2019 count of an element in a data string by 2 having a value of 0 or 1 shall always be equal to the remainder of division of a \u20181\u2019 count of an element in the string of code words resulting from conversion of said data string by 2 and conversion codes of said conversion table comprise:
basic codes for d=1, k=7, m=2 and n=3;
first substitution codes for limiting the number of consecutive appearances of said minimum run d; and
second substitution codes for keeping said run length limit k.
2. A modulation apparatus according to claim 1 characterized in that the number of pairs each comprising a data string and a code string composing said basic codes for a constraint length i of 1 is smaller than 4 (=2\u02c6m=2\u02c62).
3. A modulation apparatus according to claim 1 characterized in that said basic codes of said conversion tables have a variable length structure.
4. A modulation apparatus according to claim 1 characterized in that said basic codes of said conversion tables include a code \u2018*0*\u2019 wherein the symbol * is an indeterminate code which is \u20180\u2019 if an immediately preceding or succeeding code word is \u20181\u2019 and \u20181\u2019 if said immediately preceding or succeeding code word is \u20180\u2019, implying that said code \u2018*0*\u2019 is either \u2018000\u2019 or \u2018101\u2019.
5. A modulation apparatus according to claim 1 characterized in that said conversion codes of said conversion tables include codes each determined by referring to an immediately succeeding string of code words or an immediately succeeding data string. 5-1. A modulation apparatus according to claim 1 characterized in that said conversion codes of said conversion tables include codes each determined by referring to an immediately succeeding string of code words or a string of code words of a specific type.
6. A modulation apparatus according to claim 5 characterized in that said codes each determined by referring to an immediately succeeding string of code words or an immediately succeeding data string is said first or second substitution codes.
7. A modulation apparatus according to claim 1 characterized in that the number of pairs each comprising a data string and a code string composing said basic codes for a constraint length i of 1 is equal to 4 (=2\u02c6m=2\u02c62).
8. A modulation apparatus according to claim 1 characterized in that, for constraint lengths i of 2 and greater, said conversion codes are all said first and second substitution codes.
9. A modulation apparatus according to claim 1 characterized in said conversion codes for a constraint length i of 2 are codes for keeping said minimum run d at 1. 9-1. A modulation apparatus according to claim 1 characterized in that said conversion codes of said conversion tables include codes each determined by referring to an immediately preceding string of code words.
10. A modulation apparatus according to claim 1 characterized in that said apparatus further has a synchronization signal inserting means for inserting a synchronization signal including a unique pattern not included in said conversion codes of said conversion table into any arbitrary position in said string of code words.
11. A modulation apparatus according to claim 10 characterized in that said unique pattern is a pattern that breaks said maximum run k.
12. A modulation apparatus according to claim 10 characterized in that said unique pattern is a pattern that keeps said minimum run d.
13. A modulation apparatus according to claim 10 characterized in that a unique pattern in said synchronization signal comprises 1 code word at the head thereof serving as a connection bit with a code word resulting from conversion of up to immediately preceding data, a second bit for keeping said minimum run d and a third bit.
14. A modulation apparatus according to claim 10 characterized in that said synchronization signal is at least 12 code words in size.
15. A modulation apparatus according to claim 10 characterized in that, for a synchronization signal of at least 21 code words in size, said synchronization signal includes at least 2 patterns with a maximum run k of 8.
16. A modulation apparatus according to claim 10 characterized in that said conversion codes of said conversion table include termination codes each for terminating said code resulting from conversion.
17. A modulation apparatus according to claim 16 characterized in that said termination codes are prescribed for said basic codes with a constraint length i, for which the number of pairs each comprising a data string and a code string composing said basic codes is smaller than 4 (=2\u02c6m=2\u02c62), and enforce a conversion rule, according to which the remainder of division of a \u20181\u2019 count of an element in a data string by 2 having a value of 0 or 1 shall always be equal to the remainder of division of a \u20181\u2019 count of an element in the string of code words resulting from conversion of said data string by 2.
18. A modulation apparatus according to claim 16 characterized in that, in order to identify said termination code, 1 code word at the head of said synchronization signal pattern serving as a connection bit is set at \u20181\u2019 when said termination code is used and at \u20180\u2019 when said termination code is not used.
19. A modulation apparatus according to claim 10 characterized in that said unique pattern is sandwiched by 3 bits at the head of said synchronization signal and 3 bits at the tail of said synchronization signal and said 3 bits at said head and 3 bits at said tail are each used as a junction comprising mixed data and connection bits.
20. A modulation apparatus according to claim 10 characterized in that:
the leading first one of 3 bits at the head of said synchronization signal has a value representing data words prior to conversion viewed in m-bit units;
the next second one of said 3 bits is set at \u20181\u2019 to prescribe said synchronization signal;
the leading first one of 3 bits at the tail of said synchronization signal is set at \u20180\u2019 to prescribe said synchronization signal; and
the next second one of said 3 bits at said tail has a value representing said data words prior to conversion viewed in m-bit units.
21. A modulation apparatus according to claim 1 characterized in that said apparatus further has DSV control means for controlling a DSV of input data and supplying said DSV to said conversion means.
22. A modulation apparatus according to claim 1 characterized in that said conversion means comprises:
a first code detecting means for detecting said first substitution codes for limiting the number of consecutive appearances of said minimum run d; and
a second code detecting means for detecting said second substitution codes for keeping run length limit.
23. A modulation method to be adopted in a modulation apparatus for converting data with a basic data length of m bits into variable length code (d, k; m, n; r) with a basic code length of n bits where d is a minimum run and k is a run length limit, said. modulation method characterized by including a conversion step of converting input data into code in accordance with a conversion table wherein said conversion table enforces a conversion rule, according to which the remainder of division of a \u20181\u2019 count of an element in a data string by 2 having a value of 0 or 1 shall always be equal to the remainder of division of a \u20181\u2019 count of an element in the string of code words resulting from conversion of said data string by 2 and conversion codes of said conversion table comprise:
basic codes for d=1, k=7, m=2 and n=3;
first substitution codes for limiting the number of consecutive appearances of said minimum run d; and
second substitution codes for keeping said run length limit k.
24. A program presenting medium for presenting a program implementing processing including a conversion step of converting input data into code in accordance with a conversion table data in a modulation apparatus for converting data with a basic data length of m bits into variable length code (d, k; m, n; r) with a basic code length of n bits where d is a minimum run and k is a run length limit, said program presenting medium characterized in that said conversion table enforces a conversion rule, according to which the remainder of division of a \u20181\u2019 count of an element in a data string by 2 having a value of 0 or 1 shall always be equal to the remainder of division of a \u20181\u2019 count of an element in the string of code words resulting from conversion of said data string by 2 and conversion codes of said conversion table comprise:
basic codes for d=1, k=7, m=2 and n=3;
first substitution codes for limiting the number of consecutive appearances of said minimum run d; and
second substitution codes for keeping said run length limit k.
25. A demodulation apparatus for converting variable length code (d, k; m, n; r) with a basic code length of n bits into data with a basic data length of m bits where d is a minimum run and k is a run length limit, said demodulation apparatus characterized by having conversion means for converting input code into data in accordance with a conversion table wherein said conversion table enforces a conversion rule, according to which the remainder of division of a \u20181\u2019 count of an element in a data string by 2 having a value of 0 or 1 shall always be equal to the remainder of division of a \u20181\u2019 count of an element in the string of code words resulting from conversion of said data string by 2 and conversion codes of said conversion table comprise:
basic codes for d=1, k=7, m=2 and n=3;
first substitution codes for limiting the number of consecutive appearances of said minimum run d; and
second substitution codes for keeping said run length limit k.
26. A demodulation apparatus according to claim 25 characterized in that said apparatus further has a bit removing means for removing redundant bits inserted at predetermined intervals into said code.
27. A demodulation apparatus according to claim 26 characterized in that said redundant bits are DSV bits or synchronization signals.
28. A demodulation method to be adopted in a demodulation apparatus for converting variable length code (d, k m, n; r) with a basic code length of n bits into data with a basic data length of m bits where d is a minimum run (and k is a run length limit?), said modulation method characterized by having a conversion step of converting input code into data in accordance with a conversion table wherein said conversion table enforces a conversion rule, according to which the remainder of division of a \u20181\u2019 count of an element in a data string by 2 having a value of 0 or 1 shall always be equal to the remainder of division of a \u20181\u2019 count of an element in the string of code words resulting from conversion of said data string by 2 and conversion codes of said conversion table comprise:
basic codes for d=1, k=7, m=2 and n=3;
first substitution codes for limiting the number of consecutive appearances of said minimum run d; and
second substitution codes for keeping said run length limit k.
29. A program presenting medium for presenting a program including a conversion step of converting input code into data in accordance with a conversion table in a demodulation apparatus for converting variable length code (d, k; m, n; r) with a basic code length of n bits into data with a basic data length of m bits where d is a minimum run and k is a run length limit, said program presenting medium characterized in that said conversion table enforces a conversion rule, according to which the remainder of division of a \u20181\u2019 count of an element in a data string by 2 having a value of 0 or 1 shall always be equal to the remainder of division of a \u20181\u2019, count of an element in the string of code words resulting from conversion of said data string by 2 and conversion codes of said conversion table comprise:
basic codes for d=1, k=7, m=2 and n=3;
first substitution codes for limiting the number of consecutive appearances of said minimum run d; and
second substitution codes for keeping said run length limit k.
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 compound for the decoration of ceramics and similar material consisting of a quantity of at least one inorganic pigment and a quantity of at least one mineral glass-former, characterized by the fact that the composition also contains at least one fusion element for the glass-former and an amount of at least one non-polar material.
2. A compound according to conclusion #1, characterized by the fact that the non-polar material is selected out of the group of saturated, unsaturated or cyclical hydrocarbons containing at least 5 carbon atoms. This means: saturated or unsaturated fatty acids or compounds of two or more different fatty acids, fats or mixtures of two or more of the aforecited compounds.
3. A compound according to conclusions #1 or #2, characterized by the fact that a non-polar material is selected out of the group of wax, paraffin, stearin, vybar and a compound of two or more of these elements.
4. A compound according to conclusions #1 till #3, characterized by the fact that the pigment is from inorganic or mineral origin.
5. A compound according to conclusions #1 till #4, characterized by the fact that it contains a quantity of at least one glass-former selected out of the group of clay minerals such as feldspars, aluminium silicates, calcium silicates, boron silicates, titanites and compounds of two or more of these elements.
6. A compound according to conclusions #1 till #5, characterized by the fact that at least one mineral fusion element for the glass-former is selected out of the group with a alkaline forming character, such as: lithium compounds, sodium compounds, potassium compounds and those with a weak alkaline character, such as: magnesium oxide, calcium oxide, zinc oxide, barium oxide, lead oxide either as a natural or synthetized compound with acid forming andor amphotere oxides.
7. A compound according to conclusions #1 till #6, characterized by the fact that the pigment is encapsulated in at least one glass-former.
8. A compound according to conclusions #1 till #7, characterized by the fact that it contains 5-20 u.o.w. pigment, 1-10 u.o.w. glass-former and 5-20 u.o.w. non-polar material.
9. A compound according to conclusions #1 till #8, characterized by the fact that it contains one or more of fusion elements to influence the melting-point of the glass-former.
10. A compound according to conclusion #9, characterized by the fact that it contains one or more fusion elements selected out of the group of minerals with a alkaline character as aforecited in conclusion #6.
11. A crayon for the decoration of ceramic products according to the compounds mentioned in conclusions #1 till #10.
12. A compound according to conclusions #1 till #9, characterized by its liquid make-up, containing a quantity of water.
13. A compound according to conclusion #12, characterized by the fact that it contains a quantity of an emulgating agent.
14. A ceramic product with a decoration, produced with a compound according to one of the conclusions #1 till #10, a crayon according to conclusion #11 or the compound according to conclusions #12 and #13.