Learn More About This
Directory
This directory sponsored by SIQL, a Spider Makers company...
1. Upstream Codewords Chart
- scope.more.net
- Upstream Codewords Chart Chart Description How to Use This Chart Related Concepts.
- The Upstream Codewords chart displays the number of codewords received without errors, the number of codewords received with fixable errors, and the number of codewords received with unfixable errors by the cable modem termination system (CMTS). ...
- The chart has three graphs: the top graph shows the number of codewords received with unfixable errors; the middle graph shows the number of codewords received with fixable errors; the bottom graph shows the number of codewords received without errors. ...
- The vertical axis represents the number of codewords received. ...
- The Upstream Codewords chart shows the network volume in the cable LAN upstream channel. Any number of codewords received with unfixable errors may indicate overutilization or a physical problem. ...
- If a CMTS receives a higher-than-expected number of codewords with unfixable errors, do the following:.
- View a Trend report for the element by clicking on the Upstream Codewords chart. ...
- Identify correlations between the Upstream Codewords chart and other charts in the At-a-Glance report, such as the Errors chart or the Discards chart. For example, you might observe that an upstream channel received a large number of codewords with unfixable errors at the same time that it received a high number of errors or discarded frames (discards). ...
2. 1999-2000 ACM North Central Regional Programming Contest
- cs.nmu.edu
- Digitally, the most obvious way to do this is to associate the four binary codewords 00, 01, 10, and 11 with the four messages, and then send the appropriate codeword over the channel.
- One measure of the ability of a set of codewords to support reliable communication is the Hamming distance of the set. The Hamming distance between any two codewords is the number of bit positions in which the codewords differ. For example, the codewords 10010 and 11000 differ in two bit positions (the second and fourth bits from the left), so the Hamming distance between them is 2. The Hamming distance of a set of codewords is just the minimum Hamming distance between any two codewords in the set. The Hamming distance for the set of codewords including 10010, 11000, and 11111 set would be 2 (since the Hamming distance between 10010 and 11111 is 3, and the Hamming distance between 11000 and 11111 is also 3). The Hamming distance of our original set of two-bit codewords 00, 01, 10, and 11 is 1, insufficient to even detect a 1-bit error.
- In this problem you are to determine the Hamming distance for each of several sets of codewords. ... For example, the set of codewords 00, 01, 10, and 11 (assuming a suitable number of leading zero bits) would be specified as 0, 1, 2 and 3 respectively. Likewise, the codewords 10010, 11000, and 11111 would be specified as 18, 24, and 31 respectively. ... There will be no more than 20 codewords in any set. ...
- Each test case begins with an integer n (2 £ n £ 20) specifying the number of codewords in the set. This is followed by n signed decimal integers giving the value of the codewords. ...
- For each input case, display the case number (these are sequential, starting with 1) and the Hamming distance for the set of codewords in that test case. ...
3. Math Stinger # 1
- www2.spsu.edu
- One method used to reduce this problem is to use codewords with built in redundancy. ... A more sophisticated code can communicate more than just "yes" and "no" by using more codewords. For example, the following code has four codewords and is able to correct any single digit error: "north" = 00000 "south" = 11100 "east" = 00111 "west" = 11011. Notice that the ability of a code to correct any single digit error is due to its having the property that every pair of codewords differ in at least three positions. ... This is true for each codeword and is a result of the fact that every pair of codewords differ in at least three positions. ... The puzzle for this issue is to find a collection of eight codewords, each having six digits, that will correct any single digit error. ... After you have found them you may wonder if it is possible to find more than eight codewords with this property (still of length six). ... A second (and more difficult) puzzle is to find as many codewords of length seven as possible that correct one error. ...
4. Shortest Synchronizing Codewords of A Binary Huffman Equivalent Code
- csdl.computer.org
- 226 Shortest Synchronizing Codewords of A Binary Huffman Equivalent Code .
- Synchronizing codewords have been extensively studies as a mean to overcome the drawback and efficiently stop error propagation. ... Finally, with the help of derived conditional equations, a unified approach for constructing a binary Huffman equivalent code with most shortest synchronizing codeword(s) and most other synchronizing codewords is proposed also. ...
5. NOTE
- www.musc.edu
- Please contact me if you are having trouble getting your codewords or if need additional ones: .
6. rational philosophy: First (real) post on CodeWords
- www.raphil.org
- First (real) post on CodeWords CodeWords has its first real post, on the subject of blogs. ...
- First (real) post on CodeWords.
- CodeWords has its first real post, on the subject of blogs. ...
7. NASA: Mappings between codewords of two distinct (N,K) Reed-Solomon codes over GF (2J) : patent application (SuDoc NAS 1.71:18771-1-CU)
- satellite.argospress.com
- Satellite Communications Glossary MAPPINGS BETWEEN CODEWORDS OF TWO DISTINCT (N,K) REED-SOLOMON CODES OVER GF (2J) : PATENT APPLICATION (SUDOC NAS 1. ...
- NASA, "Mappings between codewords of two distinct (N,K) Reed-Solomon codes over GF (2J) : patent application (SuDoc NAS 1. ...
- Other subject areas related to Mappings between codewords of two distinct (N,K) Reed-Solomon codes over GF (2J) : patent application (SuDoc NAS 1. ...
- Topics in our resources on Satellite Communications related to Mappings between codewords of two distinct (N,K) Reed-Solomon codes over GF (2J) : patent application (SuDoc NAS 1. ...
- Please contact Argos Press Pty Ltd to seek permission to broadcast, adapt, reproduce and communicate Argos Press content (including this glossary entry on NASA: Mappings between codewords of two distinct (N,K) Reed-Solomon codes over GF (2J) : patent application (SuDoc NAS 1. ...
8. Studies - Texture Compression
- graphics.stanford.edu
- A higher quality compressed image is achieved by using more codewords in the codebook, or encoding the image using smaller blocks. ...
- We can extend this method to handle mipmaps by making the following observation: Given an image that is compressed using 4x4 codewords, we can create a compressed image that is half the width and height by averaging each of the 4x4 codewords down to 2x2 codewords. Applying this idea again, we can make an image that is one quarter the size by averaging the 2x2 codewords down to 1x1 codewords. ...
- Here we have compressed the color textures using a 4096 entry codebook of 4x4 codewords. ...
- Hopefully, the textures in each group would have a higher chance of having common codewords, and thus be representable by a smaller set of codewords. Here, the signs are compressed using 256 2x2 codewords, and the roads using 256 2x2 codewords, and the remaining textures using 4096 4x4 codewords for each. ...
- Here, the signs are compressed using 256 2x2 codewords, and the roads and the remaining textures are compressed using 256 4x4 codewords for each. ...
9. IT Resource Center forums - Codewords
- forums.itrc.hp.com
- Codewords.
- subject: Codewords .
- A previous thread suggested looking for codewords in the /var/adm/sw/. codewords file.
- codewords files on two of our critical systems, but these file are empty on both systems.
- codewords) where this information resides, or is it scattered all over the place depending on the product in question? .
- I'm mainly interested in the codewords for HP-UX 11, on-line JFS, and the ANSI C compiler. ...
- codewords file is empty, I think you are pretty much out of luck. That is the location that codewords for the Application CDs are stored in. Keep in mind that when you get new application CDs, you will need new codewords because the codewords are different for each set of applications CDs.
- I think the easiest thing for you to do is to request the latest set of applications CDs from HP and make sure you request the codewords for all of the software on all of your systems as well. ...
- codewords is the repository for the codewords for products that come from the Application CDROMs. ...
- Since new codewords are required to unlock each new release of the Application CDROMs you could request a new CD set *and* request matching codewords for *all* products you license. ...
- I believe that currently, if you request an Application CD set, codewords will be supplied only for updated products, so make sure that you specifically ask for *all* codewords for *all* products to which you are entitled.
- In addition, Codewords can be obtained from 800-538-1733 .
- com --> Maintenance & Support --> Under Download/Licensing -->Software Licensing (Codewords, Passwords, FAQ) .
10. CodeWords
- www.presenceofmind.net
- CodeWords Word of the Month for September:.
- Question,why is this blog called 'Codewords'?Just wondering. ...
- If 17 Cows eat 17 Oats and DEers, what WOuld RetarDS say? # posted by Cameron : 3:43 PM Welcome to CodeWords # posted by Cameron : 2:27 PM Link Text +++++++++++++++++++++++++++++++++++++++++++++++++ --> Links.
11. CCIR 584-1
- www.scancat.com
- A transmission consists of a preamble followed by batches of complete codewords, each batch commencing with a synchronization codeword (SC). ...
- D: one frame = 2 codewords.
- - 1 batch = synchronization codeword + 8 frames = 17 codewords.
- Codewords are transmitted in batches which comprise a synchronization codeword followed by 8 frames, each containing 2 codewords. ... 000 = frame 0, 111 = frame 7, and only examines address codewords in that frame. Therefore each pager's address codewords must be transmitted only in the allocated frame.
- Message codewords for any receiver may be transmitted in any frame but follow, directly, the associated address codeword. A message may consist of any number of codewords transmitted consecutively and may embrace one or more batches but the synchronization codeword must not be displaced by message codewords. ...
- 3 Types of codewords.
- Codewords contain 32 bits which are transmitted with the most significant bit first.
- FIGURE 2 - Form of address and message codewords.
- 2 Address Codewords.
- 3 Message Codewords.
- The framing rules of the code format do not apply to a message and message codewords continue until terminated by the transmission of the next address codeword or idle codeword. Each message displaces at least one address codeword or idle codeword and the displaced address codewords are delayed and transmitted in the next available appropriate frame. Although message codewords may continue into the next batch, the normal batch structure is maintained, i. ... , the batch will consist of 16 codewords, preceded by a synchronization codeword. At the conclusion of a message any waiting address codewords are transmitted, starting with the first appropriate to the first free frame or half frame.
12. Radiopaging Code No. 1
- fringe.davesource.com
- A transmission consists of a preamble followed by batches of complete codewords, each batch beginning with a synchronization codeword (SC). ...
- Codewords are transmitted in batches which comprise a synchronization codeword followed by 8 frames each containing 2 codewords. ... 000=frame 0, 111=frame 7, and only examines address codewords in that frame. Therefore each pager's address codewords must be transmitted only in the allocated frame.
- Message codewords for any receiver may be transmitted in any frame but follow, directly, the associated address codeword. A message may consist of any number of codewords transmitted consecutively and may embrace one or more batches but the synchronization codeword must not be displaced by message codewords. ...
- 3 Types of Codewords.
- Codewords contain 32 bits which are transmitted with the most significant bit first. ...
- 2 Address Codewords.
- 3 Message Codewords.
- The framing rules of the code format do not apply to the message and message codewords continue until terminated by the transmission of the next address codeword or idle codeword. Each message displaces at least one address codeword or idle codeword and the displaced address codewords are delayed and transmitted in the next available appropriate frame. Although message codewords may continue into the next batch, the normal batch structure is maintained, i. ... , the batch will consist of 16 codewords, preceded by a synchronization codeword. At the conclusion of a message any waiting address-codewords are transmitted, starting with the first appropriate to the first free frame or half frame.
- Message codewords have 20 message bits, viz bit 2 to bit 21 inclusive and these are followed by the parity check bits obtained according to the procedure outlined in 1. ...
Other related topics:
Do you have a great site about Codewords? Is
your Codewords site listed here?
Would you like a prefered placement of your site in this directory?
It's easy! First place, the HTML from the box below on your page that
you would like listed in this directory.
Then use our link submission request with
your name, your contact information, and the URL of your site that has
a link to this directory. After we
verify your link to us, we'll make sure your site stays in our directory,
and we'll give it prefered placement here also.
Here is how to make a simple text link to us. Just copy the code in this
box to your website:
We can also develop a custom Guide To The Internet for your site. Please
request your own
custom Guide To The Internet.
This custom Guide To The Internet produced by
Siql. Visit us today, and find out how to get your own
custom guide to the Internet, and how to get your site
listed in our guides.
Copyright 1995-2004 by Siql. All
Rights Reserved.