CN112241334B - Integrity checking method for power data transmission - Google Patents

Integrity checking method for power data transmission Download PDF

Info

Publication number
CN112241334B
CN112241334B CN202011191591.7A CN202011191591A CN112241334B CN 112241334 B CN112241334 B CN 112241334B CN 202011191591 A CN202011191591 A CN 202011191591A CN 112241334 B CN112241334 B CN 112241334B
Authority
CN
China
Prior art keywords
data
check code
public
sub
decomposition coefficient
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011191591.7A
Other languages
Chinese (zh)
Other versions
CN112241334A (en
Inventor
黄勇光
陈华锋
郑筠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Power Supply Bureau Co Ltd
Original Assignee
Shenzhen Power Supply Bureau Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Power Supply Bureau Co Ltd filed Critical Shenzhen Power Supply Bureau Co Ltd
Priority to CN202011191591.7A priority Critical patent/CN112241334B/en
Publication of CN112241334A publication Critical patent/CN112241334A/en
Application granted granted Critical
Publication of CN112241334B publication Critical patent/CN112241334B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1008Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices
    • G06F11/1012Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's in individual solid state devices using codes or arrangements adapted for a specific type of error
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28Databases characterised by their database models, e.g. relational or object models
    • G06F16/283Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/64Protecting data integrity, e.g. using checksums, certificates or signatures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/06Electricity, gas or water supply
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04SSYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S10/00Systems supporting electrical power generation, transmission or distribution
    • Y04S10/50Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications

Abstract

The invention provides an integrity check method for power data transmission, which comprises the following steps that S1, a data receiver receives a public check code set published by a public data warehouse and receives received data transmitted by a data output party; s2, grouping the received data to obtain a first sub-number and a second sub-number, solving a first decomposition coefficient and solving a second decomposition coefficient; step S3, solving a first synthesis number according to the first decomposition coefficient and the public check code; and solving a second synthesis number according to the second decomposition coefficient and the public check code; step S4, verifying whether the first synthesis number, the second synthesis number and the received data are equal or not; if the data are equal, judging that the transmission data are complete; if the data are not equal, the incomplete transmission data are judged. The invention judges whether the two combined numbers are equal to the original data or not to judge the integrity of the data, thereby solving the defect that the parity check cannot be globally checked.

Description

Integrity checking method for power data transmission
Technical Field
The invention relates to the technical field of electric power Internet of things, in particular to an integrity checking method for electric power data transmission.
Background
There are many systems in the current distribution network management, such as: the distribution automation system, the production management system, the customer service marketing system, the dispatching automation system, the human resource system and the like can generate various structure optimization data and unstructured data, such as model data, voltage and current information, personnel positions, topology information, switch deflection, equipment health state and the like; meanwhile, the power distribution network is connected with a large number of intelligent terminals and sensors, and intelligent wearable and handheld terminals relate to a large number of information transmission. When data is exposed to a threat of loss or corruption during transmission, data integrity verification is an important means of solving this problem. The data integrity check is currently performed by a simple random sampling method or a parity check method, but the method can only check errors and cannot correct errors, and can only check a part of error conditions, such as even bit data errors, the parity of the data is unchanged, and the errors cannot be distinguished.
Disclosure of Invention
The invention aims to provide an integrity checking method for power data transmission, which solves the technical problems that the existing parity check cannot be globally checked and cannot be corrected.
In one aspect of the present invention, there is provided an integrity checking method for power data transmission, comprising the steps of:
step S1, a data receiver receives a public check code set published by a public data warehouse, receives received data transmitted by a data output party, and determines a bit value of a public check code to be acquired according to a mantissa value of the received data;
s2, randomly grouping the received data to obtain a first sub-number and a second sub-number, and solving a first decomposition coefficient according to the first sub-number and the public check code; solving a second decomposition coefficient according to the second sub-number and the public check code;
step S3, solving a first synthesis number according to the first decomposition coefficient and the public check code; and solving a second synthesis number according to the second decomposition coefficient and the public check code;
step S4, verifying whether the first synthesis number, the second synthesis number and the received data are equal or not; if the first synthesis number, the second synthesis number and the three items of data of the received data are equal, determining that the transmission data are complete; and if the first synthesis number, the second synthesis number and the received data are not equal, judging that the transmission data are incomplete.
Preferably, the step S1 includes: public data warehouse publishes public check code set (p 1 ,p 2 ,p 3 ,p i ,p n ) Wherein n is the number of check codes, i is the sequence value of the check codes;
the data receiving party determines the mantissa value t of the received data A and determines that acquisition is neededThe number of bits of the obtained public check code is t, and the public check code (p 1 ,p 2 ,p t )。
Preferably, the step S2 includes: the received data A is arbitrarily divided into t groups according to the following formula to obtain a first sub-number (s 1 ,s 2 ,s t ) And a second number of children (s' 1 ,s′ 2 ,s′ t ):
Figure GDA0004123490950000021
Wherein i is a check code sequence value; t is the mantissa value of the received data A; a is received data; s is S i Is a first sub-number; s' i And is a second sub-number.
Preferably, the step S2 includes: by the first sub-number (s according to the following formula 1 ,s 2 ,s t ) And the public check code (p 1 ,p 2 ,p t ) Solving for the first decomposition coefficient (a 1 ,a 2 ,a t ):
a 1 =s 1 mod p 1
Figure GDA0004123490950000031
Figure GDA0004123490950000032
Figure GDA0004123490950000033
Wherein n is the number of check codes; i is a check code sequence value; (s) 1 ,s 2 ,s t ) Is a first sub-number; (p) 1 ,p 2 ,p t ) Is a public check code; (a) 1 ,a 2 ,a t ) Is the first decomposition coefficient.
Preferably, the step S2 includes: according toThe following formula is given by the second sub-number (s' 1 ,s′ 2 ,s′ t ) And the public check code (p 1 ,p 2 ,p t ) Solving for the second decomposition coefficient (a' 1 ,a′ 2 ,a′ t ):
a′ 1 =s′ 1 mod p 1
Figure GDA0004123490950000034
Figure GDA0004123490950000035
Figure GDA0004123490950000036
Wherein n is the number of check codes; i is a check code sequence value; (s' 1 ,s′ 2 ,s′ t ) A second sub-number; (p) 1 ,p 2 ,p t ) Is a public check code; (a ')' 1 ,a′ 2 ,a′ t ) Is the second decomposition coefficient.
Preferably, the step S3 includes: by the public check code (p according to the following formula 1 ,p 2 ,p t ) And the first decomposition coefficient (a 1 ,a 2 ,a t ) Solving a first synthesis number B:
B=a 1 +a 2 ×P 1 +a 3 ×P 1 ×P 2 +…a n-1 ×p 1 ×p 2 …×p n-1 +a n ×P 1 ×p 2 …×p n-1
wherein n is the number of check codes; (p) 1 ,p 2 ,p t ) Is a public check code; (a) 1 ,a 2 ,a t ) Is the first decomposition coefficient.
Preferably, the step S3 includes: by the public check code (p according to the following formula 1 ,p 2 ,p t ) And the second decomposition coefficient (a' 1 ,a′ 2 ,a′ t ) Solving a second synthesis number B':
B′=a′ 1 +a′ 2 ×p 1 +a′ 3 ×p 1 ×p 2 +…a′ n-1 ×p 1 ×p 2 …×p n-1 +a′ n ×p 1 ×p 2 …×p n-1
wherein n is the number of check codes; (p) 1 ,p 2 ,p t ) Is a public check code; (a ')' 1 ,a′ 2 ,a′ t ) Is the second decomposition coefficient.
Preferably, the step S4 includes: and when at least one of the first synthesis number, the second synthesis number and the received data is not equal to the other two, judging that the transmission data is incomplete.
In summary, the embodiment of the invention has the following beneficial effects:
the integrity checking method for power data transmission provided by the invention verifies the integrity of data according to the public check code, respectively randomly two groups of numbers of received data, calculates two groups of decomposition coefficients, then judges the integrity of the data by judging whether the two groups of numbers are equal to the original data or not, and solves the defect that the parity check cannot be globally checked.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are required in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that it is within the scope of the invention to one skilled in the art to obtain other drawings from these drawings without inventive faculty.
Fig. 1 is a schematic diagram of a network structure for integrity check of power data transmission in an embodiment of the present invention.
Fig. 2 is a schematic diagram of a main flow of an integrity check method for power data transmission according to an embodiment of the present invention.
Fig. 3 is a logic schematic diagram of an integrity checking method for power data transmission according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings, for the purpose of making the objects, technical solutions and advantages of the present invention more apparent.
As shown in fig. 1, the power system integrity verification system includes a public data warehouse, data terminals (devices, sensors, devices, etc.), data platforms (distribution automation, human resources, etc.). Public check codes are stored in a public data warehouse, and all terminals and platforms can be read but cannot be modified. The terminal or platform may act as a data receiver or data exporter.
Fig. 2 and 3 are schematic diagrams of an embodiment of an integrity checking method for power data transmission according to the present invention. In this embodiment, the method comprises the steps of:
step S1, a data receiving party receives a public check code set published by a public data warehouse, receives received data transmitted by a data output party, and determines a bit value of a public check code to be acquired according to a mantissa value of the received data. In a particular embodiment, the public data warehouse publishes a public check code set (p 1 ,p 2 ,p 3 ,p i ,p n ) Wherein n is the number of check codes, i is the sequence value of the check codes; the data receiving party determines the mantissa value t of the received data A, determines the bit value of the public check code to be acquired as t, and acquires the public check code (p 1 ,p 2 ,p t ). It will be appreciated that the public data repository publishes the public check code to the data receiver or data exporter.
S2, grouping the received data to obtain a first sub-number and a second sub-number, and solving a first decomposition coefficient according to the first sub-number and the public check code; solving a second decomposition coefficient according to the second sub-number and the public check code; it will be appreciated that arbitrary division of A into the sum of t sets of numbers results in a first sub-number (s 1 ,s 2 ,s t ) And a second number of children (s' 1 ,s′ 2 ,s′ t )。
In a specific embodiment, the received data A is arbitrarily divided into t groups according to the following formula to obtain a first sub-number (s 1 ,s 2 ,s t ) And a second number of children (s' 1 ,s′ 2 ,s′ t ):
Figure GDA0004123490950000061
Wherein i is a check code sequence value; t is the mantissa value of the received data A; a is received data; s is S i Is a first sub-number; s' i And is a second sub-number.
Specifically, the first sub-number (s 1 ,s 2 ,s t ) And the public check code (p 1 ,p 2 ,p t ) Solving for the first decomposition coefficient (a 1 ,a 2 ,a t ):
a 1 =s 1 mod p 1
Figure GDA0004123490950000062
Figure GDA0004123490950000063
Figure GDA0004123490950000064
Wherein n is the number of check codes; i is a check code sequence value; (s) 1 ,s 2 ,s t ) Is a first sub-number; (p) 1 ,p 2 ,p t ) Is a public check code; (a) 1 ,a 2 ,a t ) Is the first decomposition coefficient.
More specifically, the second sub-number (s 'is calculated by the following formula' 1 ,s′ 2 ,s′ t ) And the public check code (p 1 ,p 2 ,p t ) Solving for the second decomposition coefficient (a' 1 ,a′ 2 ,a′ t ):
a′ 1 =s′ 1 mod p 1
Figure GDA0004123490950000065
Figure GDA0004123490950000066
Figure GDA0004123490950000067
Wherein n is the number of check codes; i is a check code sequence value; (s' 1 ,s′ 2 ,s′ t ) A second sub-number; (p) 1 ,p 2 ,p t ) Is a public check code; (a ')' 1 ,a′ 2 ,a′ t ) Is the second decomposition coefficient.
Step S3, solving a first synthesis number according to the first decomposition coefficient and the public check code; and solving a second synthesis number according to the second decomposition coefficient and the public check code; it will be appreciated that the first synthesis number B and the second synthesis number B' are solved based on the decomposition coefficients and the public check code.
In a specific embodiment, the code (p) is verified by the public check code (p according to the following formula 1 ,p 2 ,p t ) And the first decomposition coefficient (a 1 ,a 2 ,a t ) Solving a first synthesis number B:
B=a 1 +a 2 ×P 1 +a 3 ×p 1 ×p 2 +…a n-1 ×p 1 ×p 2 …×p n--1 +a n ×p 1 ×p 2 …×p n-1
wherein n is the number of check codes; (p) 1 ,p 2 ,p t ) To disclose theChecking the code; (a) 1 ,a 2 ,a t ) Is the first decomposition coefficient.
Specifically, the code (p 1 ,p 2 ,p t ) And the second decomposition coefficient (a' 1 ,a′ 2 ,a′ t ) Solving a second synthesis number B':
B′=a′ 1 +a′ 2 ×p 1 +a′ 3 ×p 1 ×p 2 +…a′ n-1 ×p 1 ×p 2 …×p n-1 +a′ n ×p 1 ×p 2 …×p n-1
wherein n is the number of check codes; (p) 1 ,p 2 ,p t ) Is a public check code; (a ')' 1 ,a′ 2 ,a′ t ) Is the second decomposition coefficient.
Step S4, verifying whether the first synthesis number, the second synthesis number and the received data are equal or not; if the first synthesis number, the second synthesis number and the three items of data of the received data are equal, determining that the transmission data are complete; and if the first synthesis number, the second synthesis number and the received data are not equal, judging that the transmission data are incomplete. It can be appreciated that when at least one of the first synthesis number, the second synthesis number, and the received data is not equal to the other two, it is determined that the transmitted data is incomplete. It can be understood that whether a=b=b' is satisfied is determined, and if so, the transmission data is complete, and no data omission or tampering exists; otherwise, there is data omission and tampering.
In summary, the embodiment of the invention has the following beneficial effects:
according to the integrity verification method for power data transmission, disclosed by the invention, public verification codes are stored in a public data warehouse, and all data receivers and data output parties can read and verify the integrity of data according to the public verification codes; and verifying the integrity of the data according to the public check code, respectively and randomly selecting two groups of numbers for the received data, calculating two groups of decomposition coefficients, respectively obtaining two groups of combination numbers according to the two groups of decomposition coefficients and the public check code verification, judging whether the two groups of combination numbers are equal to the original data or not, and solving the defect that the parity check cannot be globally verified.
The above disclosure is only a preferred embodiment of the present invention, and it is needless to say that the scope of the invention is not limited thereto, and therefore, the equivalent changes according to the claims of the present invention still fall within the scope of the present invention.

Claims (7)

1. An integrity checking method for power data transmission, comprising the following steps:
step S1, a data receiver receives a public check code set published by a public data warehouse, receives received data transmitted by a data output party, and determines a bit value of a public check code to be acquired according to a mantissa value of the received data;
s2, grouping the received data to obtain a first sub-number and a second sub-number, and solving a first decomposition coefficient according to the first sub-number and the public check code; solving a second decomposition coefficient according to the second sub-number and the public check code;
wherein the first decomposition coefficient is solved by the first sub-number and the public check code according to the following formula:
a 1 =s 1 mod p 1
Figure FDA0004123490940000011
Figure FDA0004123490940000012
Figure FDA0004123490940000013
wherein n is the number of check codes; i is the check code orderA value; (s) 1 ,s 2 ,s t ) Is a first sub-number; (p) 1 ,p 2 ,p t ) Is a public check code; (a) 1 ,a 2 ,a t ) Is a first decomposition coefficient; t represents a mantissa value of the received data;
step S3, solving a first synthesis number according to the first decomposition coefficient and the public check code; and solving a second synthesis number according to the second decomposition coefficient and the public check code;
step S4, verifying whether the first synthesis number, the second synthesis number and the received data are equal or not; if the first synthesis number, the second synthesis number and the three items of data of the received data are equal, determining that the transmission data are complete; and if the first synthesis number, the second synthesis number and the received data are not equal, judging that the transmission data are incomplete.
2. The method according to claim 1, wherein the step S1 includes:
public data warehouse publishes public check code set (p 1 ,p 2 ,p 3 ,p i ,p n ) Wherein n is the number of check codes, i is the sequence value of the check codes;
the data receiving party determines the mantissa value t of the received data A, determines the bit value of the public check code to be acquired as t, and acquires the public check code (p 1 ,p 2 …p t )。
3. The method according to claim 2, wherein the step S2 includes:
the received data A is arbitrarily divided into t groups according to the following formula to obtain a first sub-number (s 1 ,s 2 ,s t ) And a second number of children (s' 1 ,s′ 2 ,s′ t ):
Figure FDA0004123490940000021
Wherein, the liquid crystal display device comprises a liquid crystal display device,i is a check code sequence value; t is the mantissa value of the received data A; a is received data; s is S i Is a first sub-number; s' i And is a second sub-number.
4. A method according to claim 3, wherein said step S2 comprises:
by the second sub-number (s 'according to the following formula' 1 ,s′ 2 ,s′ t ) And the public check code (p 1 ,p 2 ,p t ) Solving for the second decomposition coefficient (a' 1 ,a′ 2 ,a′ t ):
a′ 1 =s′ 1 mod p 1
Figure FDA0004123490940000022
Figure FDA0004123490940000023
Figure FDA0004123490940000031
Wherein n is the number of check codes; i is a check code sequence value; (s' 1 ,s′ 2 ,s′ t ) A second sub-number; (p) 1 ,p 2 ...p t ) Is a public check code; (a ')' 1 ,a′ 2 ,a′ t ) Is the second decomposition coefficient.
5. The method of claim 4, wherein the step S3 includes:
by the public check code (p according to the following formula 1 ,p 2 ...p t ) And the first decomposition coefficient (a 1 ,a 2 ,a t ) Solving a first synthesis number B:
B=a 1 +a 2 ×p 1 +a 3 ×p 1 ×p 2 +…a n-1 ×p 1 ×p 2 ...×p n-1 +a n ×p 1 ×p 2 ...×p n-1
wherein n is the number of check codes; (p) 1 ,p 2 ...p t ) Is a public check code; (a) 1 ,a 2 ,a t ) Is the first decomposition coefficient.
6. The method of claim 5, wherein the step S3 includes:
by the public check code (p according to the following formula 1 ,p 2 ...p t ) And the second decomposition coefficient (a' 1 ,a′ 2 ,a′ t ) Solving a second synthesis number B':
B′=a′ 1 +a′ 2 ×p 1 +a′ 3 ×p 1 ×p 2 +…a′ n-1 ×p 1 ×p 2 ...×p n-1 +a′ n ×p 1 ×p 2 ...×p n-1
wherein n is the number of check codes; (p) 1 ,p 2 ...p t ) Is a public check code; (a ')' 1 ,a′ 2 ,a′ t ) Is the second decomposition coefficient.
7. The method according to claim 1, wherein the step S4 includes:
and when at least one of the first synthesis number, the second synthesis number and the received data is not equal to the other two, judging that the transmission data is incomplete.
CN202011191591.7A 2020-10-30 2020-10-30 Integrity checking method for power data transmission Active CN112241334B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011191591.7A CN112241334B (en) 2020-10-30 2020-10-30 Integrity checking method for power data transmission

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011191591.7A CN112241334B (en) 2020-10-30 2020-10-30 Integrity checking method for power data transmission

Publications (2)

Publication Number Publication Date
CN112241334A CN112241334A (en) 2021-01-19
CN112241334B true CN112241334B (en) 2023-06-20

Family

ID=74170331

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011191591.7A Active CN112241334B (en) 2020-10-30 2020-10-30 Integrity checking method for power data transmission

Country Status (1)

Country Link
CN (1) CN112241334B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107395331A (en) * 2017-09-05 2017-11-24 国网四川省电力公司内江供电公司 A kind of power equipment communication data abnormal alarm system
CN108347295A (en) * 2017-01-25 2018-07-31 华为技术有限公司 A kind of data transmission method and device
CN108429599A (en) * 2017-02-13 2018-08-21 上海诺基亚贝尔股份有限公司 Method and apparatus for the data processing in communication system

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI273388B (en) * 2004-06-08 2007-02-11 Mediatek Inc Method and apparatus for processing multiple decomposed data for calculating key equation polynomials in decoding error correction code
FR3016099B1 (en) * 2013-12-26 2017-05-05 Grdf RECEPTION METHOD USING INTEGRITY CONTROL CODING
US10762979B2 (en) * 2018-10-29 2020-09-01 International Business Machines Corporation Data retention in storage drives

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108347295A (en) * 2017-01-25 2018-07-31 华为技术有限公司 A kind of data transmission method and device
CN108429599A (en) * 2017-02-13 2018-08-21 上海诺基亚贝尔股份有限公司 Method and apparatus for the data processing in communication system
CN107395331A (en) * 2017-09-05 2017-11-24 国网四川省电力公司内江供电公司 A kind of power equipment communication data abnormal alarm system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
数据安全传输及加密技术的研究;叶燕;《宜春学院学报》;20050425(第02期);全文 *

Also Published As

Publication number Publication date
CN112241334A (en) 2021-01-19

Similar Documents

Publication Publication Date Title
US10764166B2 (en) Injecting lost packets and protocol errors in a simulation environment
US20170323561A1 (en) Method for correcting electricity meter readings
CN103380585B (en) Input bit error rate presuming method and device thereof
RU2336566C2 (en) Method of modeling of processes of provision of technical readiness of communication networks in technical operation and system for its implementation
CN112380046B (en) Calculation result verification method, system, device, equipment and storage medium
CN115640285B (en) Power abnormality information transmission method, device, electronic equipment and medium
CN101288232B (en) Methods and devices for decoding and encoding data
CN109299193A (en) Method of data synchronization and relevant device
CN111953354A (en) Testing method of verification algorithm, chip, storage medium and household appliance
JPH11510982A (en) Computer assisted back signaling method in automatic repeat request method
CN112241334B (en) Integrity checking method for power data transmission
CN113691546A (en) Integrity verification method, system, equipment and medium for text file
CN1685619A (en) Cyclic redundancy check with efficient error detection code recalculation
CN110022178B (en) Detection circuit and detection method of WiFi module
CN102655441A (en) Communication automatic error correction coding method and system
Ye et al. Method for increasing reliability for transmission state of power equipment energy
CN100418312C (en) Digital data transmission error-detecting method and system
CN108011693B (en) General data coding method based on ARINC429 bus communication
CN103138880B (en) Decoding method and equipment
CN110572421A (en) Data transmission method and system
CN116610289B (en) Pseudo-random binary sequence generating device, pseudo-random binary sequence generating method, pseudo-random binary sequence detecting device, and pseudo-random binary sequence storing medium
CN115796768B (en) Device quality detection table generation method, electronic device, and computer-readable medium
CN112994251B (en) Electric quantity early warning method and device, electronic equipment and computer readable medium
CN113688601B (en) Watermark generation method and device based on form, electronic equipment and computer medium
CN112131091B (en) Test method and device and electronic equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant