|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？. P) T& d* D& m$ E. W2 \
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity- s1 B. M; T: z$ J' e p+ \1 E# `
Yi Kuang;; q8 Y1 `; p3 R
Songsong Li;- ^4 I$ D9 U0 Z1 [3 H
Shu Liu;# P! V. `3 ~* @ S% V
Liming Ma;
' w) V6 x. K& {: H: C* T* eChaoping Xing$ e# I' ]" r+ x5 L# J& C& Z
IEEE Transactions on Information Theory
1 y0 R8 S8 Q; {- T5 l1 _0 ZYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE4 K f% Z0 Y1 [: E/ v" O' l
4 O: C/ Z& i3 E' {1 UAbstract
$ b5 L X+ o, Q8 v6 B) ?2 OHTML/ m; f8 y8 u/ s# d% k. i' Q! n
* p8 `6 m( S) ~; kEncoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)
5 B# \& _; e7 O0 `0 |* YSongsong Li;0 i P0 Q0 Z$ N3 A( h
Shu Liu;) C# Z5 \7 Q8 z9 @4 M- v
Liming Ma;
3 ~ `1 ]/ D: v3 b2 NYunqi Wan;" d( X+ l) v3 `; x) J
Chaoping Xing' z5 _( p; U: l0 O; R' z( L" a
IEEE Transactions on Information Theory
" [+ w" ~. X( U; @7 z* DYear: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE
3 M5 i5 w: f g& s+ ]* O6 h" f
% a" R; A. p7 F# C7 G4 s- F2 e& YAbstract* p* C4 r5 y% q3 }1 i, z
HTML
: ^' b* a4 e7 a5 V( W2 D# X* u4 l. J4 B# q' @; t
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy$ N7 p7 p9 o h, `% z+ D+ ^- T
Shu Liu;
# p/ M5 S a0 ^& r& I* XIvan Tjuawinata;" Z0 ?2 E7 X+ |: h
Chaoping Xing
' }1 Z: S$ f2 g7 y+ |IEEE Transactions on Information Theory
/ k, ^% q4 d) JYear: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE; J- F/ j2 u3 K* H% q
Cited by: Papers (4)
4 {2 J# c! R. u( u- D7 }+ s8 s
6 @" L# z. R Q. c9 Y( `Abstract' K. _" `4 l( Z O
HTML
& z8 B6 t" O% a0 \: q3 }
2 u: c9 e4 J. {( J v' i5 ~; J9 yA Lower Bound on the List-Decodability of Insdel Codes9 A1 K8 A3 E5 X V( `. \
Shu Liu;
% B) f) k6 B# S6 ~Ivan Tjuawinata;
# h# h6 w7 X }. h7 DChaoping Xing3 o" d! Q) {6 @. @8 | K
IEEE Transactions on Information Theory
$ @8 H+ s; T4 a p8 a. o* uYear: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE" z) E+ [/ F, a3 q b1 v, I
4 V" x9 x; t- ]% ~
Abstract+ Q; a3 V4 h; X$ {9 w
HTML8 W' ]! m0 O, J. ]$ W! A
4 ?0 v: }- p& ~. _! `3 P' lA New Construction of Nonlinear Codes via Algebraic Function Fields
+ m. ^3 |$ R2 h/ g( U9 m3 EShu Liu;6 C9 F' F5 j* o. S
Liming Ma;% |4 ]5 Y8 ^. N" S9 t7 O
Ting-Yi Wu;
4 u, f* T$ K7 O7 V3 F3 FChaoping Xing" M5 ~. [/ E* c% ~2 [. J' l* f5 P
IEEE Transactions on Information Theory
: B0 j& s6 A* fYear: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE
* W9 Y- F4 _1 ?$ H! tCited by: Papers (1)
$ K" b1 V! o4 v/ a" S( g2 E8 b# i, F8 |( \( f
Abstract
( Z- l+ ^, M) a* e7 T( U1 RHTML' s/ M+ K ?9 F' g Y$ S: H
0 |4 H8 v# o: T* B/ XMaximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems. ]2 H9 Z2 ` [& k4 c
Shu Liu;
1 \" [! R6 T' [! Y1 g& }, u: qChaoping Xing1 j U9 l( ]( S* v# n
IEEE Transactions on Information Theory8 G$ E* d) n( K* l+ R3 {. ~- Q5 S
Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE! \2 w+ D; C* m4 W2 a
Cited by: Papers (2)( `; y6 [" ^8 @9 M8 u
1 A+ F6 D; a' G* u& J2 p; O3 \
Abstract
w/ r$ A0 q$ }# eHTML
T# t6 C' B3 m0 {7 o! i2 E4 t. P: W- e# |) E" `
Bounds and Constructions for Insertion and Deletion Codes
$ k! s4 L% @5 N. L- \' ]6 TShu Liu; y$ _# O( u8 g' e0 b
Chaoping Xing
7 p$ k$ K5 C: b. ]+ CIEEE Transactions on Information Theory% V) H3 _! k6 S! q' S
Year: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE9 C* M% x: t% u& A% e2 }( q" K; w& S
Cited by: Papers (14)
9 v6 a1 l& s3 f4 S% z* z. N) V" _7 D2 U2 ?. s; G2 R
Abstract0 k2 j0 p$ A5 N
HTML4 X; H, t- \+ Q& P5 s+ P; ^: _
' {( T, J; s7 u4 K$ @( n* rEfficiently List-Decodable Insertion and Deletion Codes via Concatenation6 Q; y/ ]6 l+ Q( o+ |
Shu Liu;
7 n3 t% g4 k+ X) g4 gIvan Tjuawinata;) H) o5 [4 b) q% r: }
Chaoping Xing: X# H0 }6 ?0 I0 f9 t
IEEE Transactions on Information Theory: |3 D ]* n9 S/ h' o
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE
I% `/ |! ?/ A5 \8 Z$ BCited by: Papers (6)
8 j, ] E* v* y2 B/ ]( p9 e( y- `' \4 W
Abstract; Q# C# m; ?, T3 ?! U# G
HTML, S# y; V/ s* P4 a5 C
" ]7 y7 w* ~$ j# x" _Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
$ Y( C \# D. yTai Do Duc;1 r) f& J' H ?0 A- ~+ j1 `( L
Shu Liu;$ X( t* c8 O- ~( a! o
Ivan Tjuawinata;3 _- C; G: B$ V: X9 I
Chaoping Xing
8 ]* _# J; `* zIEEE Transactions on Information Theory7 s8 L' x9 F9 X9 A. Z2 K
Year: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE3 A1 v* H5 I( B
Cited by: Papers (17)' s- }: W: V9 }' P' y9 B5 u
' Y+ [5 ^ A. Y) L Z1 b
Abstract
. H* L% r- l2 B% i; _HTML( a, ]) B e" d
- z$ J% O) G$ U, R# q9 w
List Decodability of Symbol-Pair Codes0 B- [$ Y8 N8 O1 e# T9 l
Shu Liu;- o Q2 o- l( L. H [3 e- C; M
Chaoping Xing;
" u+ W8 d" f7 q5 L0 q* fChen Yuan# K* g9 R* g4 j
IEEE Transactions on Information Theory
5 l {$ Z+ l) b/ _/ d+ ^Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE! ]( R4 U8 _+ x7 P, [
Cited by: Papers (15)) n& `! u" u% _9 g& B4 O8 @. P
) n' @0 ?2 D) Q. R1 ]
Abstract
. s7 J( i) i s' F$ S7 z6 I. wHTML5 `9 B. B8 `8 t6 j
. L6 L1 Q9 ?8 g7 n i
List Decoding of Cover Metric Codes Up to the Singleton Bound4 |% m. n; l) B! m- ^
Shu Liu;1 p/ ^8 C% ~3 M- j, s0 {0 o
Chaoping Xing;7 {) r: ]! ~; C" |- ]' k
Chen Yuan
# B* A3 |, R; u, D, I4 sIEEE Transactions on Information Theory
! m3 L, Q5 N k0 F4 LYear: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE- t9 }* I9 T9 t
Cited by: Papers (7)* i2 g) B; K: V& [
) T" T# O# K+ T# y5 ZAbstract
@ {2 c* i$ c5 H6 m4 I: cHTML; x$ y: P5 \6 z j8 I: f
$ \& G# I6 K# P1 F# l; d
List Decodability of Random Subcodes of Gabidulin Codes
6 r" X2 {9 H: ?, x8 z s# jShu Liu;. ~8 k' C' j7 L" R
Chaoping Xing;
7 Y; n" X! v- r4 @& x$ x; tChen Yuan
& f6 O+ ?1 x2 {1 H/ Q: x/ FIEEE Transactions on Information Theory
$ g2 a) e9 [2 N* QYear: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
% g8 f$ F. j6 a5 i C# `6 F6 iCited by: Papers (5)
+ n5 f/ g2 c6 W' u( T |
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主
