Mechanism to transmit text messages using ring time

1. An non-transitory computer system for transmitting and receiving a text message, the non-transitory computer system comprising:

one or more non-transitory computer-readable storage media and program instructions stored on the one or more non-transitory computer-readable storage media,

the program instructions for transmitting a text message at a caller telephone comprising:

receiving an inputted text message;

transmitting a predetermined message to a receiver telephone to determine a transmission delay time, based on a time the caller telephone receives an address complete message and a release message;

determining a constant value that is greater than the transmission delay time; and

in response to the determining the constant value, ringing the receiver telephone to transmit the received inputted text message;

the program instructions for receiving the inputted text message at the receiver telephone comprising:

receiving the predetermined message from the caller telephone to determine the transmission delay time, based on a time the receiver telephone receives the address complete message and the release message;

determining the constant value that is greater than the transmission delay time;

receiving an incoming ring from the caller telephone and converting the received ring into a text message, wherein the text message is the inputted message; and

displaying the text message.

2. The non-transitory computer system of claim 1 , wherein the program instructions for transmitting the text message comprises:

determining if the received inputted text message is a predetermined message, an original message or a hybrid message that includes a predetermined message and an original message.

3. The non-transitory computer system of claim 2 , wherein the received inputted message is determined to be a predetermined message, the program instruction further comprise:

determining a multiple factor that corresponds to the predetermined message;

determining a ring time based on the constant value being multiplied by the multiple factor; and

ringing the receiver telephone one time equal to a length of time based on the determined ring time.

4. The non-transitory computer system of claim 2 , wherein the received inputted message is determined to be an original message, the program instruction further comprise:

transforming the received inputted message into a message composed of dots and/or dashes to form a transmission string;

breaking up the transmission string into ring groups, such that each ring group is determined by the number of times the receiver telephone would ring; and

wherein the number of rings that form the ring group determine if and how many dots or dashes are transmitted.

5. The non-transitory computer system of claim 4 , wherein the number of rings that form the ring group determine if and how many dots or dashes are transmitted, further comprises:

wherein when the ring group comprises an even number of rings then a dot is being transmitted, wherein the number of dots that are transmitted is determined by the number of rings that form the ring group; and

wherein when the ring group comprises an odd number of rings then a dash is being transmitted, wherein the number of dashes that are transmitted is determined by the number of rings that form the ring group.

6. The non-transitory computer system of claim 5 , wherein the breaking up the transmission string into ring groups, further comprises:

determining a waiting period between ring groups that is below a threshold value to indicate a start of a new ring group to the receiving telephone; and

determining a waiting period between ring groups that is above a threshold value to indicate a space to the receiver.

7. The non-transitory computer system of claim 6 , wherein ringing the receiver telephone to transmit the received inputted text message, further comprises;

ringing the receiver telephone number of times to transmit the determined ring groups and spaces that form the transmission string.

8. The non-transitory computer system of claim 2 , wherein the received inputted message is determined to be a hybrid message, the program instruction further comprise:

determining which words of the hybrid message are a predetermined message and which words are an original message.

9. The non-transitory computer system of claim 8 , wherein the words of the hybrid message determined to be a predetermined message, the program instruction further comprise:

determining a multiple factor that corresponds to the predetermined message; and

determining a ring time based on the constant value being multiplied by the multiple factor.

10. The non-transitory computer system of claim 9 , wherein the words of the hybrid message determined to be an original message, the program instruction further comprise:

transforming the original message into a message composed of dots and/or dashes to form a transmission string.

11. The non-transitory computer system of claim 10 , wherein the transforming the received inputted message into a message composed of dots and/or dashes, comprises:

breaking up the transmission string into ring groups, such that each ring group is determined by the number of times the receiver telephone would rings;

wherein the number of rings that form the ring group determine if and how many dots or dashes are transmitted.

12. The non-transitory computer system of claim 11 , wherein the number of rings that form the ring group determine if and how many dots or dashes are transmitted, further comprises:

wherein when the ring group comprises an even number of rings then a dot is being transmitted, wherein the number of dots that are transmitted is determined by the number of rings that form the ring group; and

wherein when the ring group comprises an odd number of rings then a dash is being transmitted, wherein the number of dashes that are transmitted is determined by the number of rings that form the ring group.

13. The non-transitory computer system of claim 12 , wherein the breaking up the transmission string into ring groups, further comprises:

determining a waiting period between ring groups that is below a threshold value to indicate a start of a new ring group to the receiving telephone; and

determining a waiting period between ring groups that is above a threshold value to indicate a space to the receiver.

14. The non-transitory computer system of claim 13 , wherein ringing the receiver telephone to transmit the received inputted text message, further comprises;

ringing the receiver telephone one time equal to a length of time based on the determined ring time to transmit the predetermined message; and

ringing the receiver telephone number of times to transmit the determined ring groups and spaces that form the transmission string.

15. The non-transitory computer system of claim 1 , wherein the program instructions for receiving the text message comprises:

determining if the received rings from a caller telephone is transmitting a predetermined message, an original message or a hybrid message that includes a predetermined message and an original message.

16. The non-transitory computer system of claim 15 , wherein the incoming rings was determined to be a receiving a predetermined message, the program instructions further comprise:

determining a ring time length for the incoming ring and dividing the ring time by the constant value to determine a multiple factor; and

determining the predetermine message associated with the multiple factor;

wherein the displayed text message is the predetermined message.

17. The non-transitory computer system of claim 15 , wherein the incoming rings was determined to be a receiving an original message, the program instructions further comprise:

counting the number of rings received before a pause in receiving the rings to form a ring group;

determining if the time length of the pause is greater than or less than a threshold value; and

determining if the number of rings is an odd or an even number;

wherein when the ring group comprises an even number of rings then a dot is being received, wherein the number of dots that are received is determined by the number of rings that form the ring group; and

wherein when the ring group comprises an odd number of rings then a dash is being received, wherein the number of dashes that are received is determined by the number of rings that form the ring group.

18. The non-transitory computer system of claim 17 , wherein determining if the time length of the pause is greater than or less than a threshold value, comprises:

determining if the pause is below a threshold value to indicate a start of a new ring group;

determining the pause is above a threshold value to indicate a space is to be inserted in the ring groups;

forming a transmission string that includes dots, dashes and spaces determined from the ring groups and pauses;

transforming the transmission string into a text message; and

displaying the text message.

19. The non-transitory computer system of claim 15 , wherein the incoming rings was determined to be a receiving a hybrid message, the program instructions further comprise:

determining from a pause in the incoming rings if the next incoming rings is transmitting a predetermined message or an original message.

20. The non-transitory computer system of claim 19 , wherein the next incoming rings was determined to be a predetermined message, the program instructions further comprise:

determining a ring time length for the incoming ring and dividing the ring time by the constant value to determine a multiple factor; and

determining the predetermine message associated with the multiple factor.

21. The non-transitory computer system of claim 20 , wherein the next incoming rings was determined to be an original message, the program instructions further comprise:

counting the number of rings received before a pause in receiving the rings to form a ring group; and

determining if the time length of the pause is greater than or less than a threshold value.

22. The non-transitory computer system of claim 21 , wherein counting the number of rings that form the ring group, further comprises:

determining if the number of rings is an odd or an even number;

wherein when the ring group comprises an even number of rings then a dot is being received, wherein the number of dots that are received is determined by the number of rings that form the ring group; and

wherein when the ring group comprises an odd number of rings then a dash is being received, wherein the number of dashes that are received is determined by the number of rings that form the ring group.

23. The non-transitory computer system of claim 22 , wherein determining if the time length of the pause is greater than or less than a threshold value, further comprises:

determining if the pause is below a threshold value to indicate a start of a new ring group; and

determining the pause is above a threshold value to indicate a space is to be inserted in the ring groups.

24. The non-transitory computer system of claim 23 , the program instructions further comprises:

forming a transmission string that includes dots, dashes and spaces determined from the ring groups and pauses;

transforming the transmission string into a text message.

25. The non-transitory computer system of claim 24 , wherein displaying the text message, comprises:

combining the predetermined messages, the original message and the space to form the text message;

displaying the combined message that forms the text message.