H03M   1/00  \	0	0	5J022	H03M   1/00	455	ʥǥѴǥ롿ʥѴʥʥͤ麹ʬĴؤѴޤϺʬĴ饢ʥͤؤѴȣͣˡΣ	Analogue/digital conversion; Digital/analogue conversion (conversion of analogue values to or from differential modulation H03M 3/00) [4]
H03M   1/02  \	1	1	5J022	H03M   1/02	174	ĵΤ륢ʥǥѴΣ	Reversible analogue/digital converters [4]
H03M   1/04  \	1	1	5J022	H03M   1/04	145	ȥƥåѤѤΡΣ	using stochastic techniques [4]
H03M   1/06  \	1	1	5J022	H03M   1/06	371	ʪŪѥ᡼ˤԽ˾ʱƶϢ³ŪޤɻߡʼŪʤΣȣͣˡΣ	Continuously compensating for, or preventing, undesired influence of physical parameters (periodically H03M 1/10) [4]
H03M   1/08  \	2	2	5J022	H03M   1/08	31	ˤΡΣ	of noise [4]
H03M   1/08  A	2	0	5J022	H03M   1/08	1092	ʥǥѴ	Analogue-digital conversion
H03M   1/08  B	2	0	5J022	H03M   1/08	745	ǥ롿ʥѴ	Digital-analogue conversion
H03M   1/08  Z	2	0	5J022	H03M   1/08	26	¾	Others
H03M   1/10  \	1	1	5J022	H03M   1/10	41	ޤϻΣ	Calibration or testing [4]
H03M   1/10  A	1	0	5J022	H03M   1/10	1758	ʥǥѴι̸եĥȽ	Calibration of the analogue-digital converter (error or offset removal)
H03M   1/10  B	1	0	5J022	H03M   1/10	711	ǥ롿ʥѴι̸եĥȽ	Calibration of the digital-analogue converter (error or offset removal)
H03M   1/10  C	1	0	5J022	H03M   1/10	829	ʥǥѴλ	Testing of the analogue-digital converter
H03M   1/10  D	1	0	5J022	H03M   1/10	297	ǥ롿ʥѴλ	Testing of the digital-analogue converter
H03M   1/10  Z	1	0	5J022	H03M   1/10	31	¾	Others
H03M   1/12  \	1	1	5J022	H03M   1/12	55	ʥǥѴʣȣͣȣͣͥˡΣ	Analogue/digital converters (H03M 1/02-H03M 1/10 take precedence) [4]
H03M   1/12  A	1	0	5J022	H03M   1/12	1343		Input unit
H03M   1/12  B	1	0	5J022	H03M   1/12	376		Output unit
H03M   1/12  C	1	0	5J022	H03M   1/12	2411	ƥࡦ¾	System, etc.
H03M   1/12  Z	1	0	5J022	H03M   1/12	239	¾	Others
H03M   1/14  \	2	2	5J022	H03M   1/14	24	ƥƥåפƱޤϰۤʤѴʤӥåȤ¿Ϥ륹ƥåפȤѴΣ	Conversion in steps with each step involving the same or a different conversion means and delivering more than one bit [4]
H03M   1/14  A	2	0	5J022	H03M   1/14	833	̡̤ľ³	Upper/lower serial connection stage
H03M   1/14  B	2	0	5J022	H03M   1/14	502	༡󡦤¾	Sequential, cyclic, etc.
H03M   1/14  Z	2	0	5J022	H03M   1/14	12	¾	Others
H03M   1/16  \	3	3	5J022	H03M   1/16	11	եνȼΡʤƥå״֤οѲ뤳ȤˤΡΣ	with scale factor modification, i.e. by changing the amplification between the steps [4]
H03M   1/16  A	3	0	5J022	H03M   1/16	30	̡̤ľ³	Upper/lower serial connection stage
H03M   1/16  B	3	0	5J022	H03M   1/16	12	༡󡦤¾	Sequential, cyclic, etc.
H03M   1/16  Z	3	0	5J022	H03M   1/16	3	¾	Others
H03M   1/18  \	2	2	5J022	H03M   1/18	1185	Ѵ郎Ǥ뿮ϰϤ뤿μư桤㡥ưΡΣ	Automatic control for modifying the range of signals the converter can handle, e.g. gain ranging [4]
H03M   1/20  \	2	2	5J022	H03M   1/20	310	ܣӥåȤ뤿ˣӥåѤʬǽ硤㡥ǥ󥰤ˤΡΣ	Increasing resolution using an n bit system to obtain n + m bits, e.g. by dithering [4]
H03M   1/22  \	2	2	5J022	H03M   1/22	158	ѥɽФΣ	pattern-reading type [4]
H03M   1/24  \	3	3	5J022	H03M   1/24	683	Ū˲ưɤ߼֤ӱĤޤϥȥåפѤΡΣ	using relatively movable reader and disc or strip [4,6]
H03M   1/26  \	4	4	5J022	H03M   1/26	50	ŤߤŤ沽򤹤ΡʤĤΥǥåȤͿ줿Ťߤϥ֥åޤΥǥåȤΰ֤˰¸Ρ㡥δꡤνŤߤϤδΤ٤ǤΡΣ	with weighted coding, i.e. the weight given to a digit depends on the position of the digit within the block or code word, e.g. there is a given radix and the weights are powers of this radix [4]
H03M   1/28  \	4	4	5J022	H03M   1/28	34	ŤߤŤ沽򤹤ΡΣ	with non-weighted coding [4]
H03M   1/30  \	5	5	5J022	H03M   1/30	11	ʬΡΣ	incremental [4]
H03M   1/32  \	3	3	5J022	H03M   1/32	43	ɤѤΡΣ	using cathode-ray tubes [4]
H03M   1/34  \	2	2	5J022	H03M   1/34	415	ʥͤͤӤΡʣȣͣͥˡΣ	Analogue value compared with reference values (H03M 1/48 takes precedence) [4]
H03M   1/36  \	3	3	5J022	H03M   1/36	1324	ƱˤΤ߹ԤΡʤΣ	simultaneously only, i.e. parallel type [4]
H03M   1/38  \	3	3	5J022	H03M   1/38	1349	༡ˤΤ߹ԤΡ㡥༡ӷʥƥå꣱ӥåȤ¿ѴȣͣˡΣ	sequentially only, e.g. successive approximation type (converting more than one bit per step H03M 1/14) [4]
H03M   1/40  \	4	4	5J022	H03M   1/40	105	ƽΣ	recirculation type [4]
H03M   1/42  \	4	4	5J022	H03M   1/42	11	ʥͤѲʤľ³ʤˤ༡ӤˤΡΣ	Sequential comparisons in series-connected stages with no change in value of analogue signal [4]
H03M   1/44  \	4	4	5J022	H03M   1/44	437	ʥͤѲľ³ʤˤ༡ӤˤΡΣ	Sequential comparisons in series-connected stages with change in value of analogue signal [4]
H03M   1/46  \	4	4	5J022	H03M   1/46	369	Ѵ˴ͤ򶡵뤹뤿Υǥ롿ʥѴĤΡΣ	with digital/analogue converter for supplying reference values to converter [4]
H03M   1/48  \	2	2	5J022	H03M   1/48	97	ɽӷѴΣ	Servo-type converters [4]
H03M   1/50  \	2	2	5J022	H03M   1/50	433	ֳִ֤ؤѴԤΡʣȣͣͥˡΣ	with intermediate conversion to time interval (H03M 1/64 takes precedence) [4]
H03M   1/52  \	3	3	5J022	H03M   1/52	698	Ͽʬ˴᤹ͤΡΣ	Input signal integrated with linear return to datum [4]
H03M   1/54  \	3	3	5J022	H03M   1/54	124	Ͽɸܲݻ˴᤹ͤΡΣ	Input signal sampled and held with linear return to datum [4]
H03M   1/56  \	3	3	5J022	H03M   1/56	755	ϿΥ׿ӤΡΣ	Input signal compared with linear ramp [4]
H03M   1/58  \	3	3	5J022	H03M   1/58	135	ѴΣ	Non-linear conversion [4]
H03M   1/60  \	2	2	5J022	H03M   1/60	347	ѥ륹ȿؤѴԤΡΣ	with intermediate conversion to frequency of pulses [4]
H03M   1/62  \	3	3	5J022	H03M   1/62	1	ѴΣ	Non-linear conversion [4]
H03M   1/64  \	2	2	5J022	H03M   1/64	116	ȿΰؤѴԤΡΣ	with intermediate conversion to phase of sinusoidal signals [4]
H03M   1/66  \	1	1	5J022	H03M   1/66	37	ǥ롿ʥѴʣȣͣȣͣͥˡΣ	Digital/analogue converters (H03M 1/02-H03M 1/10 take precedence) [4]
H03M   1/66  A	1	0	5J022	H03M   1/66	316		Input unit
H03M   1/66  B	1	0	5J022	H03M   1/66	411		Output unit
H03M   1/66  C	1	0	5J022	H03M   1/66	880	ƥࡦ¾	System, etc.
H03M   1/66  D	1	1	5J022	H03M   1/66	225	Ѵ̣ͥ	Non-linear conversion (1/84 and 1/88 take precedence.)
H03M   1/66  E	1	1	5J022	H03M   1/66	195	ããĤѤ	using CCD
H03M   1/66  F	1	1	5J022	H03M   1/66	33	ǥݥ󥯥Ѵ	Digital-synchronisation angle conversion
H03M   1/66  Z	1	0	5J022	H03M   1/66	52	¾	Others
H03M   1/68  \	2	2	5J022	H03M   1/68	611	ۤʤ봶٤ѴȼΡʤѴ̤ΥǥӥåȤ˴Ϣ¾Ѵ̤ΥǥӥåȤ˴ϢΡΣ	with conversions of different sensitivity, i.e. one conversion relating to the more significant digital bits and another conversion to the less significant bits [4]
H03M   1/70  \	2	2	5J022	H03M   1/70	195	ѴϰϤ뤿μưΣ	Automatic control for modifying converter range [4]
H03M   1/72  \	2	2	5J022	H03M   1/72	27	ľ³ʤˤ༡ѴʣȣͣͥˡΣ	Sequential conversion in series-connected stages (H03M 1/68 takes precedence) [4]
H03M   1/74  \	2	2	5J022	H03M   1/74	1437	ƱѴΣ	Simultaneous conversion [4]
H03M   1/76  \	3	3	5J022	H03M   1/76	463	å󥰥ĥ꡼ѤΡΣ	using switching tree [4]
H03M   1/78  \	3	3	5J022	H03M   1/78	434	ϩ֤ѤΡΣ	using ladder network [4]
H03M   1/80  \	3	3	5J022	H03M   1/80	178	ŤߤŤ줿ԡ󥹤ѤΡʣȣͣͥˡΣ	using weighted impedances (H03M 1/76 takes precedence) [4]
H03M   1/82  \	2	2	5J022	H03M   1/82	824	ֳִ֤ؤѴԤΡΣ	with intermediate conversion to time interval [4]
H03M   1/84  \	3	3	5J022	H03M   1/84	39	ѴΣ	Non-linear conversion [4]
H03M   1/86  \	2	2	5J022	H03M   1/86	42	ѥ륹ȿؤѴԤΡΣ	with intermediate conversion to frequency of pulses [4]
H03M   1/88  \	3	3	5J022	H03M   1/88	3	ѴΣ	Non-linear conversion [4]
H03M   3/00  \	0	0	5J064	H03M   3/00	129	ʥͤ麹ʬĴؤѴޤϺʬĴ椫饢ʥͤؤѴΣ	Conversion of analogue values to or from differential modulation [4]
H03M   3/02  \	1	1	5J064	H03M   3/02	2303	ǥ륿ĴʤӥåȺʬĴΣ	Delta modulation, i.e. one-bit differential modulation [4]
H03M   3/04  \	1	1	5J064	H03M   3/04	634	ӥåȤκʬĴΣ	Differential modulation with several bits [4]
H03M   5/00  \	0	0	5J064	H03M   5/00	124	ġΥǥåȤɽѴΣ	Conversion of the form of the representation of individual digits
H03M   5/02  \	1	1	5J064	H03M   5/02	34	ѥ륹ˤɽؤѴޤϥѥ륹ˤɽѴΣ	Conversion to or from representation by pulses [4]
H03M   5/04  \	2	2	5J064	H03M   5/04	619	ͤĥѥ륹ˤΡΣ	the pulses having two levels [4]
H03M   5/06  \	3	3	5J064	H03M   5/06	303	ΥӥåȥξΤߤ˰¸ƤΥӥåȥФɽ㡥ܡˤΡΣ	Code representation, e.g. transition, for a given bit cell depending only on the information in that bit cell [4]
H03M   5/08  \	4	4	5J064	H03M   5/08	345	ѥ륹ˤɽΣ	Code representation by pulse width [4]
H03M   5/10  \	4	4	5J064	H03M   5/10	43	ѥ륹ȿˤɽΣ	Code representation by pulse frequency [4]
H03M   5/12  \	4	4	5J064	H03M   5/12	842	٥桤㡥ʬ桤ޥ桨ꥹڡޤϣޡ桤㡥żȿΣ	Biphase level code, e.g. split phase code, Manchester code; Biphase space or mark code, e.g. double frequency code [4]
H03M   5/14  \	3	3	5J064	H03M   5/14	319	ܤ룱ϤʾΥӥåȥξ˰¸ƤΥӥåȥФɽ㡥ܡˤΡ㡥ٱĴ桤ŽŤΣ	Code representation, e.g. transition, for a given bit cell depending on the information in one or more adjacent bit cells, e.g. delay modulation code, double density code [4]
H03M   5/16  \	2	2	5J064	H03M   5/16	485	ͤĥѥ륹ˤΡΣ	the pulses having three levels [4]
H03M   5/18  \	3	3	5J064	H03M   5/18	188	ĤͤܤͤФоΤǤΡʤʿեХݡ飳Σ	two levels being symmetrical with respect to the third level, i.e. balanced bipolar ternary code [4]
H03M   5/20  \	2	2	5J064	H03M   5/20	327	ͤ¿ͤĥѥ륹ˤΡΣ	the pulses having more than three levels [4]
H03M   5/22  \	1	1	5J064	H03M   5/22	52	ȿˤɽؤѴޤȿˤɽѴΣ	Conversion to or from representation by sinusoidal signals [4]
H03M   7/00  \	0	0	5J064	H03M   7/00	1549	󤬥ǥåȤννޤϿˤäɽƤ椫顤Ʊξ󤬥ǥåȤΰۤʤޤϿˤäɽƤؤѴΣ	Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information is represented by a different sequence or number of digits
H03M   7/02  \	1	1	5J064	H03M   7/02	273	ŤߤŤ桤ʤǥåȤͿ줿Ťߤϥ֥åޤΤΥǥåȰ֤˰¸ΡؤѴޤϽŤߤŤ椫ѴΣ	Conversion to or from weighted codes, i.e. the weight given to a digit depending on the position of the digit within the block or code word [4]
H03M   7/04  \	2	2	5J064	H03M   7/04	291	δǤΡΣ	the radix thereof being two [4]
H03M   7/06  \	2	2	5J064	H03M   7/06	89	δȰۤʤǤΡΣ	the radix thereof being a positive integer different from two [4]
H03M   7/08  \	3	3	5J064	H03M   7/08	58	δǤΡʤΣ	the radix being ten, i.e. pure decimal code [4]
H03M   7/10  \	2	2	5J064	H03M   7/10	0	δǤΡΣ	the radix thereof being negative [4]
H03M   7/12  \	2	2	5J064	H03M   7/12	242	ĤδĤΡ㡥ʲΣ	having two radices, e.g. binary-coded-decimal code [4]
H03M   7/14  \	1	1	5J064	H03M   7/14	97	ŤߤŤؤѴޤŤߤŤ椫ѴΣ	Conversion to or from non-weighted codes [4]
H03M   7/14  A	1	0	5J064	H03M   7/14	224	ŤߤŤ	Non-weighted code
H03M   7/14  B	1	0	5J064	H03M   7/14	1272	͢¢΢¡̥ӥĥȿѴ	MB R NB (number of bits) conversion
H03M   7/14  Z	1	0	5J064	H03M   7/14	71	¾Τ	Others
H03M   7/16  \	2	2	5J064	H03M   7/16	159	˥åȥǥ桤㡥쥤桤ȿͣ桤ؤѴޤϥ˥åȥǥ椫ѴΣ	Conversion to or from unit-distance codes, e.g. Gray code, reflected binary code [4]
H03M   7/18  \	2	2	5J064	H03M   7/18	18	;ؤѴޤϾ;椫ѴΣ	Conversion to or from residue codes [4]
H03M   7/20  \	2	2	5J064	H03M   7/20	64	ȥ֣ؤѴޤϣȥ֣椫ѴΣ	Conversion to or from n-out-of-m codes [4]
H03M   7/22  \	3	3	5J064	H03M   7/22	54	ȥ֣ؤѴޤϣȥ֣椫ѴΣ	to or from one-out-of-m codes [4]
H03M   7/24  \	2	2	5J064	H03M   7/24	66	ưؤѴޤư椫ѴΣ	Conversion to or from floating-point codes [4]
H03M   7/26  \	1	1	5J064	H03M   7/26	1	ȥƥåؤѴޤϥȥƥå椫ѴΣ	Conversion to or from stochastic codes [4]
H03M   7/28  \	1	1	5J064	H03M   7/28	41	ץǽʹʤѴѴ뤿˥ڥ졼ˤѹǽǤ֤ޤΡΣ	Programmable structures, i.e. where the code converter contains apparatus which is operator-changeable to modify the conversion process [4]
H03M   7/30  \	1	1	5J064	H03M   7/30	1509	̡ʾĹθΤβʬϡݹǣ̣̿ѤΣȣΡˡĥɬפʥǡް㡤Ĺ٤θΣ	Compression (speech analysis-synthesis for redundancy reduction G10L 19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction [4]
H03M   7/30  A	1	0	5J064	H03M   7/30	4783	ľѴޡݥѴ	Orthogonal transformation, Hadamard transformation
H03M   7/30  B	1	0	5J064	H03M   7/30	1284	٥ȥ̻Ҳ٥ȥ沽	Vector quantisation, vector encoding
H03M   7/30  Z	1	0	5J064	H03M   7/30	4601	¾Τ	Others
H03M   7/32  \	2	2	5J064	H03M   7/32	537	ǥ륿Ĵ桤ʤӥåȺʬĴ桤ؤѴޤϥǥ륿Ĵ椫ѴΣ	Conversion to or from delta modulation, i.e. one-bit differential modulation [4]
H03M   7/34  \	3	3	5J064	H03M   7/34	58	ŬΣ	adaptive [4]
H03M   7/36  \	2	2	5J064	H03M   7/36	3145	ӥåȤκʬĴ桤ʤϢ³ɸܤκ򣱥ӥåȤ¿ӥåȤ沽ΡؤѴޤϿӥåȤκʬĴ椫ѴΣ	Conversion to or from differential modulation with several bits, i.e. the difference between successive samples being coded by more than one bit [4]
H03M   7/38  \	3	3	5J064	H03M   7/38	683	ŬΣ	adaptive [4]
H03M   7/40  \	2	2	5J064	H03M   7/40	3547	Ĺ桤㡥Υ󡦥ե桤ϥեޥ桤⡼륹桤ؤѴޤϲĹ椫ѴΣ	Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code [4]
H03M   7/42  \	3	3	5J064	H03M   7/42	762	沽沽ɽȤΡ㡥꡼ɥ꡼꡼ȤΡΣ	using table look-up for the coding or decoding process, e.g. using read-only memory [4]
H03M   7/44  \	3	3	5J064	H03M   7/44	17	̵طΰ̡Σ	Suppression of irrelevant zeroes [4]
H03M   7/46  \	2	2	5J064	H03M   7/46	938	󥰥桤ʤƱϢ³ǥåȤޤϥǥåȤηοɤǤޤμλؼԤäƤǥåȤɽ뤳ȤˤΡؤѴޤϥ󥰥椫ѴΣ	Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind [4]
H03M   7/48  \	3	3	5J064	H03M   7/48	49	Ѵδ֡¾ȸؤΡ㡥󥰥沽ƱΥǥåȤνʬĹ³¤ԤʤΡΣ	alternating with other codes during the code conversion process, e.g. run-length coding being performed only as long as sufficiently long runs of digits of the same kind are present [4]
H03M   7/50  \	2	2	5J064	H03M   7/50	360	ؤѴޤ椫Ѵ㡥ˤΡΣ	Conversion to or from non-linear codes, e.g. companding [4]
H03M   9/00  \	0	0	5J064	H03M   9/00	45	ľѴޤϤεդѴʾ󤬥ƥå׷ǰưǥ뵭֣ǣãˡΣ	Parallel/series conversion or <u>vice versa</u> (digital stores in which the information is moved stepwise G11C 19/00) [4]
H03M   9/00 100 \	0	0	5J064	H03M   9/00	420	ľ󢫢Ѵ	to series or to parallel conversion
H03M   9/00 200 \	0	0	5J064	H03M   9/00	501	ݢľѴ	parallel to series conversion
H03M   9/00 300 \	0	0	5J064	H03M   9/00	516	ľݢѴ	series to parallel conversion
H03M  11/00  \	0	0	5B020	H03M  11/00	175	ܡɤޤϤ֤˴Ϣ沽ʤ줿ΰ֤沽ʥܡɥå֡ȥܡɤȤι¤ŪʷȣȣȣˣˡΣ	Coding in connection with keyboards or like devices, i.e. coding of the position of operated keys (keyboard switch arrangements, structural association of coders and keyboards H01H13/70, H03K17/94) [4]
H03M  11/00 300 \	1	1	5B020	H03M  11/00	28	եȥ७θФ̤ɻ	Phantom keys detection and prevention
H03M  11/00 600 \	1	1	5B020	H03M  11/00	9	ܡɤ沽ɻߺ	Measures for preventing unauthorised decoding of keyboards
H03M  11/02  \	1	1	5B020	H03M  11/02	91	Σ	Details [5]
H03M  11/04  \	2	2	5B020	H03M  11/04	77	¿ǽ沽Σ	Coding of multifunction keys [5]
H03M  11/06  \	3	3	5B020	H03M  11/06	42	¿ǽ켫Τ򤤤ˡ뤳ȤˤΡΣ	by operating the multifunction key itself in different ways [5]
H03M  11/08  \	4	4	5B020	H03M  11/08	1136	¿ǽȤ߹碌뤳ȤˤΡΣ	by operating selected combinations of multifunction keys [5]
H03M  11/10  \	4	4	5B020	H03M  11/10	639	η³֤ޤϰϤθФ˴ŤˡˤΡΣ	by methods based on duration or pressure detection of keystrokes [5]
H03M  11/12  \	4	4	5B020	H03M  11/12	634	륭򤷤Ϣ³θ塤̤ߤ줿Ϣνλ򼨤󥿡򲡤ȤˤΡΣ	by operating a key a selected number of consecutive times whereafter a separate enter key is used which marks the end of the series [5]
H03M  11/14  \	3	3	5B020	H03M  11/14	1184	¿ǽˤäƿԤ뵡ǽꤹղåѤΡ㡥եȥѤΡΣ	by using additional keys, e.g. shift keys, which determine the function performed by the multifunction key [5]
H03M  11/16  \	4	4	5B020	H03M  11/16	799	¿ǽ˥եȥΡΣ	wherein the shift keys are operated after the operation of the multifunction keys [5]
H03M  11/18  \	4	4	5B020	H03M  11/18	803	¿ǽ˥եȥΡΣ	wherein the shift keys are operated before the operation of the multifunction keys [5]
H03M  11/20  \	1	1	5B020	H03M  11/20	982	ưŪ沽ʤˤΡʣȣͣͥˡΣ	Dynamic coding, i.e. by key scanning (H03M11/26 takes precedence) [5]
H03M  11/22  \	1	1	5B020	H03M  11/22	1279	Ū沽ʣȣͣͥˡΣ	Static coding (H03M11/26 takes precedence) [5]
H03M  11/24  \	2	2	5B020	H03M  11/24	243	ʥʤѤΡΣ	using analogue means [5]
H03M  11/26  \	1	1	5B020	H03M  11/26	376	ץȥ쥯ȥ˥ʤѤΡΣ	using opto-electronic means [5]
H03M  13/00  \	0	0	5J065	H03M  13/00	3784	θФޤϸΤ沽沽ޤѴδŪꡨ沽θ³Ψɾˡ̿ϩǥ롨Υߥ졼ޤϻʥʥǥѴǥ롿ʥѴޤѴΤθθФޤϸȣͣȣͣǥ׻äŬ礹ΣǣƣϿôΤѴȤδ֤бư˴Ť󵭲ΤΤΣǣ¡㡥ǣ£ŪΤΤΣǣáˡΣ	Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes (error detection or error correction for analogue/digital, digital/analogue or code conversion H03M 1/00-H03M 11/00; specially adapted for digital computers G06F 11/08, for information storage based on relative movement between record carrier and transducer G11B, e.g. G11B 20/18, for static stores G11C) [4,7]
H03M  13/01  \	1	1	5J065	H03M  13/01	166	δŪꡨ沽θ³Ψɾˡ̿ϩǥ롨Υߥ졼ޤϻΣ	Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes [7]
H03M  13/03  \	1	1	5J065	H03M  13/03	42	ǡɽξĹ˴Ť긡Фޤʤ夬θ¿ΥǥåȤޤΡΣ	Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words [7]
H03M  13/05  \	2	2	5J065	H03M  13/05	99	֥åѤΡʤ˷᤿θӥåȤ˷᤿ξӥåȤղäΡΣ	using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits [7]
H03M  13/07  \	3	3	5J065	H03M  13/07	6	Σ	Arithmetic codes [7]
H03M  13/09  \	3	3	5J065	H03M  13/09	449	긡ФΤߡ㡤ĹΣãңá桤ޤñѥƥӥåȤѤΡΣ	Error detection only, e.g. using cyclic redundancy check (CRC) codes or single parity bit [7]
H03M  13/11  \	3	3	5J065	H03M  13/11	112	ʣΥѥƥӥåȤѤΡΣ	using multiple parity bits [7]
H03M  13/13  \	3	3	5J065	H03M  13/13	317	Σ	Linear codes [7]
H03M  13/15  \	4	4	5J065	H03M  13/15	795	桤ʤ󥷥եȤ̤ȤʤΡ㡤¿༰桤ܡɡꡦå󥸥Σ£ݣãݣȣϡΣ£ãȡʣȣͣͥˡΣ	Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem (BCH) codes (H03M 13/17 takes precedence) [7]
H03M  13/17  \	4	4	5J065	H03M  13/17	9	Сȸ㡤ȥåԥ󥰡եΣ	Burst error correction, e.g. error trapping, Fire codes [7]
H03M  13/19  \	4	4	5J065	H03M  13/19	1644	Ȥʤñ㡤ϥߥ桤ޤϰ̲줿ϥߥΣ	Single error correction without using particular properties of the cyclic codes, e.g. Hamming codes, extended or generalised Hamming codes [7]
H03M  13/21  \	3	3	5J065	H03M  13/21	17	桤㡤긡Фޤϸȼӥåȡǡ줫ݥӥåȥǡؤΡΣ£¡ѴΣ	Non-linear codes, e.g. m-bit data word to n-bit code word (mBnB) conversion with error detection or error correction [7]
H03M  13/23  \	2	2	5J065	H03M  13/23	1819	߹ѤΡ㡥˥åȡΣ	using convolutional codes, e.g. unit memory codes [7]
H03M  13/25  \	1	1	5J065	H03M  13/25	440	沽ˤ긡Фޤʤ֤˾ĹղäΡ㡥ȥꥹ沽ĴΣԣã͡ϡΣ	Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation (TCM) [7]
H03M  13/27  \	1	1	5J065	H03M  13/27	2014	󥿡꡼ֵѤѤΡΣ	using interleaving techniques [7]
H03M  13/29  \	1	1	5J065	H03M  13/29	1586	İʾޤ湽¤Ȥ߹碌Ρ㡥桤̲줿桤Ϣ桤椪ӳΣ	combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes [7]
H03M  13/31  \	1	1	5J065	H03M  13/31	8	긡ФޤΤ沽ӡڥȥΨŪѤ뤿沽Ȥ߹碌ʸ긡ФޤԤʤΣȣͣˡΣ	combining coding for error detection or correction and efficient use of the spectrum (without error detection or correction H03M 5/14) [7]
H03M  13/33  \	1	1	5J065	H03M  13/33	41	沽ޤ沽˴ŤƱΣ	Synchronisation based on error coding or decoding [7]
H03M  13/35  \	1	1	5J065	H03M  13/35	234	ԶѰݸŬθݸ㡥ξν˱ơۤʤ٥ݸͿΡޤϡͥѲ˱沽ŬΡΣ	Unequal or adaptive error protection, e.g. by providing a different level of protection according to significance of source information or by adapting the coding according to the change of transmission channel characteristics [7]
H03M  13/37  \	1	1	5J065	H03M  13/37	214	ȣͣȣͣޤǤΥ롼פʬवƤμ沽˸ꤵʤ沽ˡޤϵѡΣ	Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M 13/03-H03M 13/35 [7]
H03M  13/39  \	2	2	5J065	H03M  13/39	289	ꡤʤƹۤ뤿ŪˡѤΡΣ	Sequence estimation, i.e using statistical methods for the reconstruction of the original codes [7]
H03M  13/41  \	3	3	5J065	H03M  13/41	911	ӥӡ르ꥺޤϥӥӡץåѤΡΣ	using the Viterbi algorithm or Viterbi processors [7]
H03M  13/43  \	2	2	5J065	H03M  13/43	28	¿桤ޤϡΣ	Majority logic or threshold decoding [7]
H03M  13/45  \	2	2	5J065	H03M  13/45	649	եȡǥǥ󥰡ʤοѤΡʣȣͣͥˡΣ	Soft decoding, i.e. using symbol reliability information (H03M 13/41 takes precedence) [7]
H03M  13/47  \	1	1	5J065	H03M  13/47	176	ȣͣȣͣޤǤΥ롼פʬवʤ긡С뤤ϸݸΣ	Error detection, forward error correction or error protection, not provided for in groups H03M 13/01-H03M 13/37 [7]
H03M  13/49  \	2	2	5J065	H03M  13/49	0	ñθ긡ФޤΣ	Unidirectional error detection or correction [7]
H03M  13/51  \	2	2	5J065	H03M  13/51	72	Ťߤ桨ȥ֣桨СΣ	Constant weight codes; n-out-of-m codes; Berger codes [7]
H03M  13/53  \	2	2	5J065	H03M  13/53	3	եܥʥåѤΣ	Codes using Fibonacci numbers series [7]
H03M  99/00  \	0	0	5J065	H03M  99/00	0	Υ֥饹¾Υ롼פʬवʤΣ	Subject matter not provided for in other groups of this subclass [8]
